Hypergraphs accumulate infinitely often
Abstract
We show that the set (k) of Tur\'an densities of k-uniform hypergraphs has infinitely many accumulation points in [0,1) for every k ≥ 3. This extends an earlier result of ours showing that (k) has at least one such accumulation point.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.