Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.13335 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916215155326976 |
|---|---|
| author | Gerbner, Dániel |
| author_facet | Gerbner, Dániel |
| contents | Given graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in $n$-vertex $F$-free graphs. We study the case when either $H$ or $F$ is a matching. We obtain several asymptotic and exact results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_13335 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Generalized Turán results for matchings Gerbner, Dániel Combinatorics Given graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in $n$-vertex $F$-free graphs. We study the case when either $H$ or $F$ is a matching. We obtain several asymptotic and exact results. |
| title | Generalized Turán results for matchings |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.13335 |