Graphs with many copies of a given subgraph
Abstract
We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.
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.