Turán problems for simplicial complexes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908493061029888 |
|---|---|
| author | Axenovich, Maria Gerbner, Dániel Liu, Dingyuan Patkós, Balázs |
| author_facet | Axenovich, Maria Gerbner, Dániel Liu, Dingyuan Patkós, Balázs |
| contents | An abstract simplicial complex $\mathbf{F}$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n,\mathbf{F})$ is the maximum number of edges in an $\mathbf{F}$-free simplicial complex on $n$ vertices. This extremal number is naturally related to the generalised Turán numbers of certain underlying hypergraphs. Making progress in a problem raised by Conlon, Piga, and Schülke, we find large classes of simplicial complexes whose extremal numbers are determined by the respective generalised hypergraph Turán numbers. We also provide simplicial complexes for which such a relation does not hold. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_12763 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Turán problems for simplicial complexes Axenovich, Maria Gerbner, Dániel Liu, Dingyuan Patkós, Balázs Combinatorics An abstract simplicial complex $\mathbf{F}$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n,\mathbf{F})$ is the maximum number of edges in an $\mathbf{F}$-free simplicial complex on $n$ vertices. This extremal number is naturally related to the generalised Turán numbers of certain underlying hypergraphs. Making progress in a problem raised by Conlon, Piga, and Schülke, we find large classes of simplicial complexes whose extremal numbers are determined by the respective generalised hypergraph Turán numbers. We also provide simplicial complexes for which such a relation does not hold. |
| title | Turán problems for simplicial complexes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2508.12763 |