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 1CombinatoricsBroader topic: It asks how many relations or components a structure can have before a pattern is forced.Paul ErdősRelated: Many Erdős problems ask how many edges or elements force a particular configuration.Endre 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.History of combinatoricsBroader topic: Its growth shifted attention from counting configurations to proving their sharp limits.Algebraic combinatoricsCompared with: It often seeks sharp bounds where algebraic combinatorics may instead encode structure.Baranyai's theoremNarrower topic: The theorem belongs to a field concerned with existence and structure of combinatorial configurations.Combinatorial principlesRelated: It turns counting bounds into questions about how large structures can be.