KnowraExtremal combinatoricsLinked fromLinked fromThe 9 pages that link to Extremal combinatorics, each with the reason it gives.All 9Broader topic 2Related 2Narrower topic 4Compared with 1Endre SzemerédiNarrower topic: Many of Szemerédi’s results bound how large a progression-free set can be.Erdős–Ko–Rado theoremNarrower topic: The theorem is a foundational maximum-size result in this field.Erdős–Szekeres theorem (monotone subsequences)Narrower topic: Sharpness asks how long a sequence can be while avoiding both required subsequences.Baranyai's theoremNarrower topic: The theorem belongs to a field concerned with existence and structure of combinatorial configurations.