Ramsey Theory

Ramsey Theory is a branch of combinatorics in discrete mathematics that studies the conditions under which sufficiently large discrete structures, under arbitrary partitions or colorings, necessarily contain substructures exhibiting prescribed patterns or order.

1.4K

Publications

55K

Citations

1.5K

Authors

654

Institutions

Publications per year

2017–2026

138

Authors

1.5K

  1. BS
    Benny Sudakov

    Princeton University, United States

    33 publications · 1.4K citations

    22

    h-index

  2. VR
    Vojtěch Rödl

    Emory University, United States

    35 publications · 1.5K citations

    22

    h-index

  3. CR
    Cecil Rousseau

    University of Memphis, United States

    31 publications · 999 citations

    19

    h-index

  4. NA
    Noga Alon

    Tel Aviv University, Israel

    22 publications · 1.2K citations

    19

    h-index

  5. RJ
    Ralph J. Faudree

    University of Memphis, United States

    24 publications · 1.2K citations

    17

    h-index

1–5 of 1.5K

Venues

  1. Discrete Mathematics

    113 publications · 3.4K citations

    31

    h-index

  2. Journal of Graph Theory

    81 publications · 2.7K citations

    29

    h-index

  3. Journal of Combinatorial Theory Series B

    54 publications · 2.4K citations

    28

    h-index

  4. Journal of Symbolic Logic

    53 publications · 2.4K citations

    25

    h-index

  5. COMBINATORICA

    40 publications · 1.9K citations

    25

    h-index

1–5