Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call