On a hypergraph Turán problem of Balogh-Bohman-Bollobás-Zhao
Abstract
Let S and T be disjoint sets with |S|=i and |T|=r-1 for 2 i r-1, and let Bi(r) be the r-graph on S T whose edges are the r-subsets containing S or T. We study the deficit qr,i:=1-π(Bi(r)) in its Turán density. Balogh, Bohman, Bollobás, and Zhao previously obtained bounds for these deficits with logarithmic gaps near both ends of the sequence Bi(r), namely, when i=O(1) or i=r-O(1). We close these gaps by showing that, as r∞, for every fixed integer a1, qr,a+1=Θa(r-a), and for every fixed integer b2, qr,r-b=Θb(r-b r).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.