On Turán problems with bounded matching number
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929682435276800 |
|---|---|
| author | Gerbner, Dániel |
| author_facet | Gerbner, Dániel |
| contents | Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-free graphs with matching number at most $s$. For fixed $F$ and $s$, we determine this number apart from a constant additive term. We also obtain several exact results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_03272 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On Turán problems with bounded matching number Gerbner, Dániel Combinatorics Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-free graphs with matching number at most $s$. For fixed $F$ and $s$, we determine this number apart from a constant additive term. We also obtain several exact results. |
| title | On Turán problems with bounded matching number |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2211.03272 |