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

Authors

4.1K

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    99 publications · 4.8K citations

    38

    h-index

  2. SJ
    Svante Janson

    Uppsala University, Sweden

    63 publications · 3.7K citations

    31

    h-index

  3. BS
    Benny Sudakov

    Princeton University, United States

    44 publications · 2.4K citations

    26

    h-index

  4. NA
    Noga Alon

    Tel Aviv University, Israel

    37 publications · 2.9K citations

    25

    h-index

  5. MK
    Michael Krivelevich

    Tel Aviv University, Israel

    46 publications · 2K citations

    23

    h-index

1–5 of 4.1K

Venues

  1. Random Structures and Algorithms

    363 publications · 21.4K citations

    67

    h-index

  2. The Annals of Probability

    89 publications · 4.4K citations

    37

    h-index

  3. Combinatorics Probability Computing

    161 publications · 6.7K citations

    37

    h-index

  4. arXiv (Cornell University)

    Repository · 155 publications · 3.9K citations

    33

    h-index

  5. COMBINATORICA

    49 publications · 3.9K citations

    32

    h-index

1–5