Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.