Hypergraph Ramsey Numbers

Hypergraph Ramsey Numbers is a numerical invariant in combinatorics that denotes the smallest integer \( n \) such that any 2-coloring of the edges of a complete \( k \)-uniform hypergraph on \( n \) vertices contains a monochromatic complete subhypergraph on a specified number of vertices.

40

Publications

1.4K

Citations

68

Authors

53

Institutions

Publications per year

2017–2026

8

Authors

68

  1. VR
    V. Rödl

    Emory University, United States

    4 publications · 150 citations

    4

    h-index

  2. AG
    András Gyárfás

    Hungarian Academy of Sciences, Hungary

    4 publications · 108 citations

    4

    h-index

  3. DM
    Dhruv Mubayi

    University of Illinois Chicago, United States

    4 publications · 82 citations

    4

    h-index

  4. AR
    Andrzej Ruciński

    Adam Mickiewicz University in Poznań, Poland

    3 publications · 129 citations

    3

    h-index

  5. VR
    Vojtěch Rödl

    Emory University, United States

    3 publications · 65 citations

    3

    h-index

1–5 of 68

Venues

  1. The Electronic Journal of Combinatorics

    4 publications · 523 citations

    4

    h-index

  2. Combinatorics Probability Computing

    4 publications · 108 citations

    4

    h-index

  3. Journal of Combinatorial Theory Series A

    4 publications · 151 citations

    4

    h-index

  4. Journal of Graph Theory

    4 publications · 59 citations

    4

    h-index

  5. COMBINATORICA

    3 publications · 111 citations

    3

    h-index

1–5