On Turán problems with bounded matching number
Dániel Gerbner
Abstract
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.
Topics & Concepts
MathematicsCombinatoricsMatching (statistics)Bounded functionVertex (graph theory)Constant (computer programming)Discrete mathematicsGraphStatisticsComputer scienceMathematical analysisProgramming languageLimits and Structures in Graph TheoryGraph theory and applicationsAdvanced Graph Theory Research