paper

Sunflowers in set systems with small VC-dimension

arXiv:2408.04165

Abstract

A family of distinct sets is an -sunflower if for all and , we have . Erdős and Rado conjectured in 1960 that every family of -element sets of size at least contains an -sunflower, where is some function that depends only on . We prove that if is a family of -element sets of VC-dimension at most and for some absolute constant , then contains an -sunflower. This improves a recent result of Fox, Pach, and Suk. When , we obtain a sharp bound, namely that 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.

16 pages, 1 figure

Sunflowers in set systems with small VC-dimension · wovepaper