Hypergraph Ramsey Theory

Hypergraph Ramsey Theory is a branch of combinatorial mathematics that extends classical Ramsey Theory by studying the conditions under which monochromatic subhypergraphs necessarily emerge in edge-colored hypergraphs, thereby generalizing Ramsey-type results from graphs to higher-uniformity set systems.

46

Publications

1.6K

Citations

72

Authors

59

Institutions

Publications per year

2017–2026

9

Authors

72

  1. AG
    András Gyárfás

    Hungarian Academy of Sciences, Hungary

    4 publications · 108 citations

    4

    h-index

  2. VR
    V. Rödl

    Emory University, United States

    4 publications · 150 citations

    4

    h-index

  3. AR
    Andrzej Ruciński

    Adam Mickiewicz University in Poznań, Poland

    4 publications · 154 citations

    4

    h-index

  4. DM
    Dhruv Mubayi

    University of Illinois Chicago, United States

    4 publications · 82 citations

    4

    h-index

  5. VR
    Vojtěch Rödl

    Emory University, United States

    4 publications · 90 citations

    4

    h-index

1–5 of 72

Venues

  1. Combinatorics Probability Computing

    5 publications · 155 citations

    5

    h-index

  2. Journal of Graph Theory

    4 publications · 72 citations

    4

    h-index

  3. The Electronic Journal of Combinatorics

    4 publications · 523 citations

    4

    h-index

  4. Journal of Combinatorial Theory Series A

    4 publications · 151 citations

    4

    h-index

  5. COMBINATORICA

    4 publications · 172 citations

    4

    h-index

1–5