Sunflowers in set systems with small VC-dimension
Abstract
A family of r distinct sets \A1,…, Ar\ is an r-sunflower if for all 1 ≤slant i < j ≤slant r and 1 ≤slant i' < j' ≤slant r, we have Ai Aj = Ai' Aj'. Erdos and Rado conjectured in 1960 that every family H of -element sets of size at least K(r) contains an r-sunflower, where K(r) is some function that depends only on r. We prove that if H is a family of -element sets of VC-dimension at most d and |H| > (C r ( d+ )) for some absolute constant C > 0, then H contains an r-sunflower. This improves a recent result of Fox, Pach, and Suk. When d=1, we obtain a sharp bound, namely that |H| > (r-1) is sufficient. Along the way, we establish a strengthening of the Kahn-Kalai conjecture for set families of bounded VC-dimension, which is of independent interest.
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.