On hypergraph Turán problems with bounded matching number
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914969213206528 |
|---|---|
| author | Gerbner, Dániel Tompkins, Casey Zhou, Junpeng |
| author_facet | Gerbner, Dániel Tompkins, Casey Zhou, Junpeng |
| contents | Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_07455 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On hypergraph Turán problems with bounded matching number Gerbner, Dániel Tompkins, Casey Zhou, Junpeng Combinatorics Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results. |
| title | On hypergraph Turán problems with bounded matching number |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2410.07455 |