Extremal Combinatorics
Extremal set theory, Ramsey theory, and Turán-type problems.
Extremal Combinatorics. Extremal set theory, Ramsey theory, and Turán-type problems.
Foundations and canonical references
The standard treatments of extremal combinatorics approach the subject from complementary angles. Jukna, Extremal Combinatorics (2011) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Alon, The Probabilistic Method (2016) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for extremal combinatorics include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2011Extremal Combinatoricsjukna-2011
- textbook · primary · 2016The Probabilistic Methodalon-2016, spencer-2016
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Explore
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.