K4-free graphs have sparse halves
Abstract
Every K4-free graph on n vertices has a set of n/2 vertices spanning at most n2/18 edges.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.