On generalized Turán problems with bounded matching number
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913548841517056 |
|---|---|
| author | Xue, Yisai Kang, Liying |
| author_facet | Xue, Yisai Kang, Liying |
| contents | The generalized Turán number $\mathrm{ex}(n, H, \mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \in \mathcal{F}$. Alon and Frankl initiated the study of Turán problems with a bounded matching number.In this paper, we establish stability results for generalized Turán problems with bounded matching number.Using the stability results, we provide exact values of $\ex(n,K_r,\{F,M_{s+1}\})$ for $F$ being any non-bipartite graph or a path on $k$ vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12338 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On generalized Turán problems with bounded matching number Xue, Yisai Kang, Liying Combinatorics 05C35 The generalized Turán number $\mathrm{ex}(n, H, \mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \in \mathcal{F}$. Alon and Frankl initiated the study of Turán problems with a bounded matching number.In this paper, we establish stability results for generalized Turán problems with bounded matching number.Using the stability results, we provide exact values of $\ex(n,K_r,\{F,M_{s+1}\})$ for $F$ being any non-bipartite graph or a path on $k$ vertices. |
| title | On generalized Turán problems with bounded matching number |
| topic | Combinatorics 05C35 |
| url | https://arxiv.org/abs/2410.12338 |