Rado's Theorem

Rado's Theorem is a foundational result in Ramsey theory that characterizes the partition regularity of systems of linear equations over the integers by providing necessary and sufficient conditions under which such systems admit monochromatic solutions under any finite coloring.

84

Publications

4.1K

Citations

121

Authors

96

Institutions

Publications per year

2017–2026

10

Variants

Rado Theorem

Authors

121

  1. PF
    Péter Frankl

    Centre National de la Recherche Scientifique, France

    7 publications · 600 citations

    7

    h-index

  2. KM
    Karen Meagher

    University of Regina, Canada

    7 publications · 136 citations

    7

    h-index

  3. ST
    Stevo Todorčević

    University of Toronto, Canada

    3 publications · 150 citations

    3

    h-index

  4. GH
    Glenn Hurlbert

    Arizona State University, United States

    2 publications · 48 citations

    2

    h-index

  5. SA
    Serap A. Savari

    Texas A&M University, United States

    2 publications · 31 citations

    2

    h-index

1–5 of 121

Venues

  1. Journal of Combinatorial Theory Series A

    11 publications · 584 citations

    10

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 6 publications · 788 citations

    6

    h-index

  3. COMBINATORICA

    6 publications · 467 citations

    6

    h-index

  4. Discrete Mathematics

    5 publications · 103 citations

    5

    h-index

  5. arXiv (Cornell University)

    Repository · 4 publications · 124 citations

    4

    h-index

1–5