Ramsey Property

Ramsey Property is a mathematical property in combinatorics that characterizes structures by guaranteeing the existence of monochromatic substructures under finite colorings, distinguishing it from other combinatorial properties through its foundational role in asserting unavoidable regularity in sufficiently large systems.

713

Publications

26.8K

Citations

768

Authors

428

Institutions

Publications per year

2017–2026

78

Authors

768

  1. VR
    Vojtěch Rödl

    Emory University, United States

    28 publications · 1.2K citations

    19

    h-index

  2. CR
    Cecil Rousseau

    University of Memphis, United States

    26 publications · 862 citations

    17

    h-index

  3. JN
    Jaroslav Nešetřil

    Charles University, Czechia

    23 publications · 914 citations

    16

    h-index

  4. BS
    Benny Sudakov

    Princeton University, United States

    23 publications · 893 citations

    16

    h-index

  5. RJ
    Ralph J. Faudree

    University of Memphis, United States

    17 publications · 985 citations

    14

    h-index

1–5 of 768

Venues

  1. Journal of Graph Theory

    65 publications · 2.1K citations

    26

    h-index

  2. Discrete Mathematics

    63 publications · 1.9K citations

    25

    h-index

  3. Journal of Combinatorial Theory Series B

    44 publications · 2.3K citations

    25

    h-index

  4. COMBINATORICA

    31 publications · 1.4K citations

    21

    h-index

  5. Combinatorics Probability Computing

    30 publications · 1.1K citations

    20

    h-index

1–5