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
Sign-in/Register to access full text options
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have