Ramsey's Theorem

Ramsey's Theorem is a foundational result in combinatorics that asserts that in any sufficiently large complete structure—such as a graph or set system—partitioned into finitely many classes, there necessarily exists a large complete substructure, all of whose elements belong to the same class.

656

Publications

26.8K

Citations

658

Authors

366

Institutions

Publications per year

2017–2026

71

Authors

658

  1. VR
    Vojtěch Rödl

    Emory University, United States

    26 publications · 1.2K citations

    19

    h-index

  2. BS
    Benny Sudakov

    Princeton University, United States

    23 publications · 1K citations

    18

    h-index

  3. CR
    Cecil Rousseau

    University of Memphis, United States

    25 publications · 603 citations

    16

    h-index

  4. JN
    Jaroslav Nešetřil

    Charles University, Czechia

    20 publications · 725 citations

    15

    h-index

  5. PE
    Paul Erdős

    Hungarian Academy of Sciences, Hungary

    15 publications · 1.3K citations

    15

    h-index

1–5 of 658

Venues

  1. Discrete Mathematics

    58 publications · 1.7K citations

    23

    h-index

  2. Journal of Graph Theory

    51 publications · 1.7K citations

    23

    h-index

  3. Journal of Combinatorial Theory Series B

    34 publications · 1.7K citations

    21

    h-index

  4. Journal of Symbolic Logic

    33 publications · 1.8K citations

    20

    h-index

  5. Journal of Combinatorial Theory Series A

    29 publications · 1.6K citations

    19

    h-index

1–5