Extremal Combinatorics
Extremal Combinatorics is a branch of combinatorics that studies the maximum or minimum possible size of a combinatorial structure satisfying certain constraints, distinguishing it from other branches by focusing on extremal properties under forbidden configurations or specified conditions.
593
Publications
21.3K
Citations
903
Authors
470
Institutions
Publications per year
2017–2026
120
593
On Metric Generators of Graphs
András Sebö, Éric Tannier · Mathematics of Operations Research · 2004 · 509 citations
On extremal problems of graphs and generalized graphs
P. Erdös · Israel Journal of Mathematics · 1964 · 449 citations
Stanisław Radziszowski · The Electronic Journal of Combinatorics · 2011 · 430 citations · Full text
Regularity Lemma for k‐uniform hypergraphs
Vojtěch Rödl, Jozef Skokan · Random Structures and Algorithms · 2004 · 266 citations
1–5 of 593
903
13
h-index
12
h-index
11
h-index
10
h-index
8
h-index
1–5 of 903
470

Hungarian Academy of Sciences
Budapest, Hungary
18 h-index
28 publications
1.6K citations
Emory University
Atlanta, United States
16 h-index
21 publications
1.7K citations
University of Illinois Urbana-Champaign
Urbana, United States
14 h-index
24 publications
1.4K citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
12 h-index
15 publications
930 citations
Central China Normal University
Wuhan, China
12 h-index
24 publications
562 citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
22 publications
1.1K citations

Eötvös Loránd University
Budapest, Hungary
10 h-index
11 publications
1.1K citations

Tel Aviv University
Tel Aviv, Israel
10 h-index
15 publications
1.6K citations
1–8 of 470
49 publications · 2K citations
23
h-index
37 publications · 1.2K citations
22
h-index
37 publications · 816 citations
20
h-index
28 publications · 1.3K citations
17
h-index
21 publications · 657 citations
16
h-index
1–5