Graphs with many r-cliques have large complete r-partite subgraphs
Abstract
We prove that for all r≥2 and c>0, every graph of order n with at least cnr cliques of order r contains a complete r-partite graph with each part of size cr n . This result implies a concise form of the Erdos-Stone theorem.
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.