Concepedia

Ramsey-type Arguments

Ramsey-Type Arguments is a systematic method in combinatorial mathematics that, by invoking the Pigeonhole Principle or related partition theorems, establishes the existence of structured subconfigurations within large discrete systems by guaranteeing that at least one cell of a partition inherits desired regularities under finite colorings.

73

Publications

4K

Citations

123

Authors

94

Institutions

Publications per year

2017–2026

3

Parents

Publications

73

A partition calculus in set theory

Péter L. Erdős, R. Rado · Bulletin of the American Mathematical Society · 1956 · 439 citations · Full text

, , +10

RECURRENCE IN ERGODIC THEORY AND COMBINATORIAL NUMBER THEORY

L. N. Vaserstein · Bulletin of the London Mathematical Society · 1982 · 328 citations

, , +11

Temporary Stabilization: Predetermined Exchange Rates

Guillermo A. Calvo · Journal of Political Economy · 1986 · 241 citations

, , +17

A new proof that analytic sets are Ramsey

Erik Ellentuck · Journal of Symbolic Logic · 1974 · 235 citations

, , +8

Combinatorial theorems in sparse random sets

David Conlon, W. T. Gowers · Annals of Mathematics · 2016 · 179 citations

, , +16

1–5 of 73

Authors

123

  1. BS
    Benny Sudakov

    Princeton University, United States

    4 publications · 216 citations

    4

    h-index

  2. DC
    David Conlon

    University of Cambridge, United Kingdom

    3 publications · 226 citations

    3

    h-index

  3. GN
    Gábor N. Sárközy

    Worcester Polytechnic Institute, United States

    3 publications · 62 citations

    3

    h-index

  4. NA
    Noga Alon

    Tel Aviv University, Israel

    3 publications · 227 citations

    3

    h-index

  5. VR
    Vojtěch Rödl

    Emory University, United States

    2 publications · 76 citations

    2

    h-index

1–5 of 123

Institutions

94

  1. Princeton University

    Princeton, United States

    4 h-index

    4 publications

    258 citations

  2. Tel Aviv University

    Tel Aviv, Israel

    4 h-index

    6 publications

    475 citations

  3. Hungarian Academy of Sciences

    Budapest, Hungary

    3 h-index

    5 publications

    154 citations

  4. Worcester Polytechnic Institute

    Worcester, United States

    3 h-index

    5 publications

    86 citations

  5. University of Illinois Urbana-Champaign

    Urbana, United States

    3 h-index

    11 publications

    274 citations

  6. Alfréd Rényi Institute of Mathematics

    Budapest, Hungary

    3 h-index

    4 publications

    90 citations

  7. University of Cambridge

    Cambridge, United Kingdom

    3 h-index

    3 publications

    223 citations

  8. Rutgers, The State University of New Jersey

    New Brunswick, United States

    3 h-index

    3 publications

    314 citations

1–8 of 94

Venues

  1. Combinatorics Probability Computing

    7 publications · 314 citations

    7

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 6 publications · 150 citations

    6

    h-index

  3. Journal of Graph Theory

    6 publications · 284 citations

    6

    h-index

  4. Journal of Symbolic Logic

    5 publications · 297 citations

    5

    h-index

  5. The Electronic Journal of Combinatorics

    4 publications · 107 citations

    4

    h-index

1–5