Sunflowers in set systems with small VC-dimension
Combinatorics
2025-09-25 v2 Discrete Mathematics
Probability
Abstract
A family of distinct sets is an -sunflower if for all and , we have . Erd\H{o}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.
Keywords
Cite
@article{arxiv.2408.04165,
title = {Sunflowers in set systems with small VC-dimension},
author = {József Balogh and Anton Bernshteyn and Michelle Delcourt and Asaf Ferber and Huy Tuan Pham},
journal= {arXiv preprint arXiv:2408.04165},
year = {2025}
}
Comments
16 pages, 1 figure