Probabilistic Combinatorics
Probabilistic Combinatorics is a branch of combinatorics that employs probabilistic methods to prove the existence of combinatorial structures with prescribed properties, establish threshold phenomena in random discrete systems, and analyze the typical behavior of randomly generated combinatorial objects.
3.7K
Publications
186.2K
Citations
4.1K
Authors
1.3K
Institutions
Publications per year
2017–2026
386
3.7K
1–5 of 3.7K
4.1K
38
h-index
31
h-index
26
h-index
25
h-index
23
h-index
1–5 of 4.1K
1.3K
University of California, Berkeley
Berkeley, United States
50 h-index
166 publications
13.5K citations
Microsoft (United States)
Redmond, United States
43 h-index
134 publications
13K citations
Carnegie Mellon University
Pittsburgh, United States
40 h-index
180 publications
9.5K citations

Tel Aviv University
Tel Aviv, Israel
34 h-index
142 publications
8.1K citations

Centre National de la Recherche Scientifique
Paris, France
33 h-index
150 publications
8.8K citations

Uppsala University
Uppsala, Sweden
33 h-index
86 publications
4.3K citations
University of Cambridge
Cambridge, United Kingdom
33 h-index
88 publications
6.2K citations
Stanford University
Stanford, United States
32 h-index
96 publications
6.7K citations
1–8 of 1.3K
363 publications · 21.4K citations
67
h-index
89 publications · 4.4K citations
37
h-index
161 publications · 6.7K citations
37
h-index
Repository · 155 publications · 3.9K citations
33
h-index
49 publications · 3.9K citations
32
h-index
1–5