Hypergraphs accumulate
David Conlon, Bjarne Sch\"ulke

TL;DR
This paper demonstrates that the set of Turán densities for k-uniform hypergraphs has accumulation points within [0,1), highlighting complex density behaviors, especially noting 1/2 as an accumulation point for 3-uniform hypergraphs.
Contribution
It establishes the existence of accumulation points in the set of Turán densities for all k ≥ 3, revealing new structural properties of hypergraph densities.
Findings
Turán densities have accumulation points in [0,1)
1/2 is an accumulation point for 3-uniform hypergraphs
The set of densities exhibits complex limiting behaviors
Abstract
We show that for every integer , the set of Tur\'an densities of -uniform hypergraphs has an accumulation point in . In particular, is an accumulation point for the set of Tur\'an densities of -uniform hypergraphs.
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
TopicsProcess Optimization and Integration · Scheduling and Optimization Algorithms
