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

Authors

903

  1. PH
    Pierre Hansen

    Group for Research in Decision Analysis, Canada

    14 publications · 836 citations

    13

    h-index

  2. SL
    Shuchao Li

    Central China Normal University, China

    12 publications · 268 citations

    12

    h-index

  3. VR
    Vojtěch Rödl

    Emory University, United States

    11 publications · 1K citations

    11

    h-index

  4. MA
    Michael A. Henning

    University of Johannesburg, South Africa

    10 publications · 238 citations

    10

    h-index

  5. BS
    Benny Sudakov

    Princeton University, United States

    8 publications · 332 citations

    8

    h-index

1–5 of 903

Venues

  1. Discrete Mathematics

    49 publications · 2K citations

    23

    h-index

  2. Journal of Graph Theory

    37 publications · 1.2K citations

    22

    h-index

  3. Discrete Applied Mathematics

    37 publications · 816 citations

    20

    h-index

  4. The Electronic Journal of Combinatorics

    28 publications · 1.3K citations

    17

    h-index

  5. Combinatorics Probability Computing

    21 publications · 657 citations

    16

    h-index

1–5