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!
|
Table of 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.