Hypergraphs accumulate infinitely often

2025/06/03 by David Conlon, Conlon, David, Bjarne Schülke +1 · 1 citation
Computer Science · Mathematics · #05C35 #05C65 #05D05 #05D99 #Advanced Graph Theory Research #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #FOS: Mathematics #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.2506.03080

openalex publication_date 2025/06/03 · openalex created_date 2025/10/14 · openalex updated_date 2026/07/28

Abstract

We show that the set Π^(k) of Turán 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.

Citations

• Hypergraphs accumulate
• Hypergraphs with arbitrarily small codegree Turán density
• On Possible Turan Densities

Cited by

• Relative Turán densities for ordered graphs: all and nothing

Related

• Hypergraphs accumulate
• Uniform Turán density beyond 3-graphs
• Hypergraphs with uniform Turán density equal to 8/27
• Infinitely many accumulation points of codegree Turán densities
• Hypergraphs with minimum positive uniform Turán density