Hypergraphs accumulate infinitely often
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916776201158656 |
|---|---|
| author | Conlon, David Schülke, Bjarne |
| author_facet | Conlon, David Schülke, Bjarne |
| contents | 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 \geq 3$. This extends an earlier result of ours showing that $Π^{(k)}$ has at least one such accumulation point. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03080 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hypergraphs accumulate infinitely often Conlon, David Schülke, Bjarne Combinatorics 05C65, 05C35, 05D05, 05D99 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 \geq 3$. This extends an earlier result of ours showing that $Π^{(k)}$ has at least one such accumulation point. |
| title | Hypergraphs accumulate infinitely often |
| topic | Combinatorics 05C65, 05C35, 05D05, 05D99 |
| url | https://arxiv.org/abs/2506.03080 |