Ramsey-type Theorems

Ramsey-Type Theorems is a class of mathematical results in combinatorics that generalize the classical Ramsey Theorem by establishing conditions under which order necessarily emerges in large, disordered structures, specifically guaranteeing the existence of monochromatic substructures under finite partitions.

763

Publications

29K

Citations

781

Authors

433

Institutions

Publications per year

2017–2026

90

Authors

781

  1. VR
    Vojtěch Rödl

    Emory University, United States

    26 publications · 1.1K citations

    19

    h-index

  2. BS
    Benny Sudakov

    Princeton University, United States

    26 publications · 948 citations

    18

    h-index

  3. CR
    Cecil Rousseau

    University of Memphis, United States

    21 publications · 445 citations

    15

    h-index

  4. PE
    Paul Erdős

    Hungarian Academy of Sciences, Hungary

    15 publications · 698 citations

    15

    h-index

  5. JN
    Jaroslav Nešetřil

    Charles University, Czechia

    21 publications · 689 citations

    15

    h-index

1–5 of 781

Venues

  1. Journal of Graph Theory

    66 publications · 2.2K citations

    28

    h-index

  2. Discrete Mathematics

    72 publications · 2.2K citations

    26

    h-index

  3. Journal of Symbolic Logic

    39 publications · 2K citations

    22

    h-index

  4. Combinatorics Probability Computing

    36 publications · 1.1K citations

    22

    h-index

  5. Journal of Combinatorial Theory Series B

    37 publications · 1.4K citations

    21

    h-index

1–5