English

Hypergraphs accumulate infinitely often

Combinatorics 2025-06-04 v1

Abstract

We show that the set Π(k)\Pi^{(k)} of Tur\'an densities of kk-uniform hypergraphs has infinitely many accumulation points in [0,1)[0,1) for every k3k \geq 3. This extends an earlier result of ours showing that Π(k)\Pi^{(k)} has at least one such accumulation point.

Keywords

Cite

@article{arxiv.2506.03080,
  title  = {Hypergraphs accumulate infinitely often},
  author = {David Conlon and Bjarne Schülke},
  journal= {arXiv preprint arXiv:2506.03080},
  year   = {2025}
}

Comments

10 pages

R2 v1 2026-07-01T02:57:23.166Z