Random algebraic construction of extremal graphs
Abstract
In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
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.