Survey of generalized Turán problems -- counting subgraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915323911864320 |
|---|---|
| author | Gerbner, Dániel Palmer, Cory |
| author_facet | Gerbner, Dániel Palmer, Cory |
| contents | For fixed graphs $H$ and $F$, the \emph{generalized Turán number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose study was initiated in an influential 2016 article by Alon and Shikhelman (\emph{J. Combin. Theory, B}, {\bf 121}, 2016). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03418 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Survey of generalized Turán problems -- counting subgraphs Gerbner, Dániel Palmer, Cory Combinatorics For fixed graphs $H$ and $F$, the \emph{generalized Turán number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose study was initiated in an influential 2016 article by Alon and Shikhelman (\emph{J. Combin. Theory, B}, {\bf 121}, 2016). |
| title | Survey of generalized Turán problems -- counting subgraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.03418 |