DOI: 10.1002/jgt.23067 ISSN: 0364-9024
On Turán problems with bounded matching number
Dániel Gerbner- Geometry and Topology
- Discrete Mathematics and Combinatorics
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.