On Tur\'an problems with bounded matching number
Abstract
Very recently, Alon and Frankl initiated the study of the maximum number of edges in n-vertex F-free graphs with matching number at most s. For fixed F and s, we determine this number apart from a constant additive term. We also obtain several exact results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.