Every graph is eventually Tur\'an-good
Combinatorics
2024-09-24 v2
Abstract
Let be a graph. We show that if is large enough as a function of , then the -partite Tur\'an graph maximizes the number of copies of among all -free graphs on a given number of vertices. This confirms a conjecture of Gerbner and Palmer.
Cite
@article{arxiv.2208.08499,
title = {Every graph is eventually Tur\'an-good},
author = {Natasha Morrison and JD Nir and Sergey Norin and Paweł Rzążewski and Alexandra Wesolek},
journal= {arXiv preprint arXiv:2208.08499},
year = {2024}
}