Paths are Tur\'an-good
Abstract
We show that among Kk+1-free n-vertex graphs, the Tur\'an graph contains the most copies of any path.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.