On Turán problems with bounded matching number
Journal of Graph Theory · 2024-05 · 106 (1) · 23-29
DOI: 10.1002/jgt.23067 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 06.12.2023. Verfasst von Dániel Gerbner. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 8 Literaturangaben.
Abstract (Originalsprache)
Very recently, Alon and Frankl initiated the study of the maximum number of edges in ‐vertex ‐free graphs with matching number at most . For fixed and , we determine this number apart from a constant additive term. We also obtain several exact results.
Zitieren
APA
Gerbner, D. (2024). On Turán problems with bounded matching number. Journal of Graph Theory, 106(1), 23-29. https://doi.org/10.1002/jgt.23067
Vancouver
Gerbner D. On Turán problems with bounded matching number. Journal of Graph Theory. 2024;106(1):23-29. doi:10.1002/jgt.23067
BibTeX
@article{Gerbner2024,
author = {Gerbner, Dániel},
title = {On Turán problems with bounded matching number},
journal = {Journal of Graph Theory},
year = {2024},
volume = {106},
number = {1},
pages = {23--29},
doi = {10.1002/jgt.23067}
}
EUVIMED