Ramsey Saturation

Ramsey Saturation is a theoretical framework in extremal combinatorics that identifies the minimum conditions under which a graph must exhibit a saturated state with respect to monochromatic substructures under edge colorings, distinguishing it from related Ramsey-type properties by emphasizing extremal thresholds for unavoidable pattern formation.

5

Publications

284

Citations

14

Authors

10

Institutions

Publications per year

2017–2026

0

Authors

14

  1. MF
    Michael Ferrara

    University of Colorado Denver, United States

    2 publications · 28 citations

    2

    h-index

  2. JR
    John R. Schmitt

    Middlebury College, United States

    1 publications · 15 citations

    1

    h-index

  3. RR
    RG Ramsey

    1 publications · 81 citations

    1

    h-index

  4. NH
    Nobuhiro Hata

    National Institute of Advanced Industrial Science and Technology, Japan

    1 publications · 10 citations

    1

    h-index

  5. CE
    C E Zacharias

    1 publications · 81 citations

    1

    h-index

1–5 of 14

Venues

  1. Applied Physics A

    2 publications · 175 citations

    2

    h-index

  2. Journal of Combinatorics

    JOC · 1 publications · 15 citations

    1

    h-index

  3. American Journal of Roentgenology

    AJR · 1 publications · 81 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 13 citations

    1

    h-index

1–4