English

Sunflowers in set systems of bounded dimension

Combinatorics 2021-03-29 v2

Abstract

Given a family F\mathcal F of kk-element sets, S1,,SrFS_1,\ldots,S_r\in\mathcal F form an {\em rr-sunflower} if SiSj=SiSjS_i \cap S_j =S_{i'} \cap S_{j'} for all iji \neq j and iji' \neq j'. According to a famous conjecture of Erd\H os and Rado (1960), there is a constant c=c(r)c=c(r) such that if Fck|\mathcal F|\ge c^k, then F\mathcal F contains an rr-sunflower. We come close to proving this conjecture for families of bounded {\em Vapnik-Chervonenkis dimension}, VC-dim(F)d(\mathcal F)\le d. In this case, we show that rr-sunflowers exist under the slightly stronger assumption F210k(dr)2logk|\mathcal F|\ge2^{10k(dr)^{2\log^{*} k}}. Here, log\log^* denotes the iterated logarithm function. We also verify the Erd\H os-Rado conjecture for families F\mathcal F of bounded {\em Littlestone dimension} and for some geometrically defined set systems.

Keywords

Cite

@article{arxiv.2103.10497,
  title  = {Sunflowers in set systems of bounded dimension},
  author = {Jacob Fox and Janos Pach and Andrew Suk},
  journal= {arXiv preprint arXiv:2103.10497},
  year   = {2021}
}
R2 v1 2026-06-24T00:20:01.123Z