Hypergraph Extremal Problems
Hypergraph Extremal Problems is a research framework in extremal combinatorics that systematically studies the maximum or minimum possible size of a hypergraph subject to specific structural or combinatorial constraints, distinguishing it from other extremal problems by its focus on hypergraph families and their forbidden substructures, Turán-type thresholds, or extremal configurations.
79
Publications
3.1K
Citations
127
Authors
88
Institutions
Publications per year
2017–2026
16
79
Regularity Lemma for k‐uniform hypergraphs
Vojtěch Rödl, Jozef Skokan · Random Structures and Algorithms · 2004 · 266 citations
Extremal problems on set systems
Péter Frankl, Vojtěch Rödl · Random Structures and Algorithms · 2002 · 157 citations
EXTREMAL RESULTS FOR RANDOM DISCRETE STRUCTURES
2009 · 147 citations
Problems and results on judicious partitions
B. Bollobás, Alex Scott · Random Structures and Algorithms · 2002 · 112 citations
1–5 of 79
127
7
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 127
88
Emory University
Atlanta, United States
8 h-index
9 publications
750 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
8 publications
778 citations

Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
7 publications
402 citations

Eötvös Loránd University
Budapest, Hungary
3 h-index
3 publications
151 citations
University of Illinois Chicago
Chicago, United States
3 h-index
4 publications
47 citations
Courant Institute of Mathematical Sciences
New York, United States
3 h-index
3 publications
110 citations
University of Memphis
Memphis, United States
3 h-index
3 publications
152 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
3 h-index
4 publications
280 citations
1–8 of 88
Repository · 9 publications · 172 citations
9
h-index
8 publications · 252 citations
8
h-index
6 publications · 698 citations
6
h-index
4 publications · 147 citations
4
h-index
4 publications · 90 citations
4
h-index
1–5