English

Paths are Tur\'an-good

Combinatorics 2022-04-19 v1

Abstract

We show that among Kk+1K_{k+1}-free nn-vertex graphs, the Tur\'an graph contains the most copies of any path.

Keywords

Cite

@article{arxiv.2204.07638,
  title  = {Paths are Tur\'an-good},
  author = {Dániel Gerbner},
  journal= {arXiv preprint arXiv:2204.07638},
  year   = {2022}
}
R2 v1 2026-06-24T10:49:34.209Z