Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2208.08499 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929509212618752 |
|---|---|
| author | Morrison, Natasha Nir, JD Norin, Sergey Rzążewski, Paweł Wesolek, Alexandra |
| author_facet | Morrison, Natasha Nir, JD Norin, Sergey Rzążewski, Paweł Wesolek, Alexandra |
| contents | Let $H$ be a graph. We show that if $r$ is large enough as a function of $H$, then the $r$-partite Turán graph maximizes the number of copies of $H$ among all $K_{r+1}$-free graphs on a given number of vertices. This confirms a conjecture of Gerbner and Palmer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_08499 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Every graph is eventually Turán-good Morrison, Natasha Nir, JD Norin, Sergey Rzążewski, Paweł Wesolek, Alexandra Combinatorics 05C35 Let $H$ be a graph. We show that if $r$ is large enough as a function of $H$, then the $r$-partite Turán graph maximizes the number of copies of $H$ among all $K_{r+1}$-free graphs on a given number of vertices. This confirms a conjecture of Gerbner and Palmer. |
| title | Every graph is eventually Turán-good |
| topic | Combinatorics 05C35 |
| url | https://arxiv.org/abs/2208.08499 |