On cliques in hypergraphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915588164550656 |
|---|---|
| author | Gao, Jun |
| author_facet | Gao, Jun |
| contents | We prove that for any $k \ge 3$, every $k$-uniform hypergraph on $n$ vertices contains at most $n - ω(1)$ different sizes of cliques (maximal complete subgraphs). In particular, the 3-uniform case answers a question of Erdős. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_14804 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On cliques in hypergraphs Gao, Jun Combinatorics We prove that for any $k \ge 3$, every $k$-uniform hypergraph on $n$ vertices contains at most $n - ω(1)$ different sizes of cliques (maximal complete subgraphs). In particular, the 3-uniform case answers a question of Erdős. |
| title | On cliques in hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.14804 |