Hypergraphs accumulate infinitely often
David Conlon, Bjarne Sch\"ulke

TL;DR
This paper proves that the set of Turán densities for k-uniform hypergraphs has infinitely many accumulation points within the interval [0,1) for all k ≥ 3, extending previous results.
Contribution
It establishes that the set of Turán densities for k-uniform hypergraphs has infinitely many accumulation points, generalizing earlier findings.
Findings
The set of Turán densities has infinitely many accumulation points.
This holds for all k ≥ 3.
It extends previous results on the structure of Turán densities.
Abstract
We show that the set of Tur\'an densities of -uniform hypergraphs has infinitely many accumulation points in for every . This extends an earlier result of ours showing that has at least one such accumulation point.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Optimization Algorithms Research · Polynomial and algebraic computation
