Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs
Abstract
Let l>k>2. Let the k-graph Hkl be obtained from the complete 2-graph Kl2 by enlarging each edge with a new set of k-2 vertices. Mubayi ["A hypergraph extension of Turan's theorem", to appear in J. Combin. Th. (B)] computed asymptotically the Turan function ex(n,Hlk). Here we determine the exact value of ex(n,Hlk) for all sufficiently large n, settling a conjecture of Mubayi.
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.