Sunflowers in set systems of bounded dimension
Abstract
Given a family F of k-element sets, S1,…,Sr∈ F form an r-sunflower if Si Sj =Si' Sj' for all i ≠ j and i' ≠ j'. According to a famous conjecture of Erd os and Rado (1960), there is a constant c=c(r) such that if | F| ck, then F contains an r-sunflower. We come close to proving this conjecture for families of bounded Vapnik-Chervonenkis dimension, VC-dim( F) d. In this case, we show that r-sunflowers exist under the slightly stronger assumption | F|210k(dr)2* k. Here, * denotes the iterated logarithm function. We also verify the Erd os-Rado conjecture for families F of bounded Littlestone dimension and for some geometrically defined set systems.
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.