On hypergraph Tur\'an problems with bounded matching number
Abstract
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in n-vertex F-free graphs with bounded matching number, respectively. We consider the analogous Tur\'an problems on hypergraphs with bounded matching number, and we obtain some 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.