arXiv Open Access 2022

Paths are Turán-good

Dániel Gerbner

Lihat Sumber

Abstrak

We show that among $K_{k+1}$-free $n$-vertex graphs, the Turán graph contains the most copies of any path.

math.CO

Dániel Gerbner

APA MLA BibTeX

Gerbner, D. (2022). Paths are Turán-good. https://arxiv.org/abs/2204.07638

Lihat di Sumber

Informasi Jurnal