On Tur\'an problems with bounded matching number
Combinatorics
2025-01-22 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2211.03272,
title = {On Tur\'an problems with bounded matching number},
author = {Dániel Gerbner},
journal= {arXiv preprint arXiv:2211.03272},
year = {2025}
}