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
Parents
5
Non-linear ramsey resonance in the optical region
Ye. V. Baklanov, B. Dubetsky, V. P. Chebotayev · Applied Physics A · 1976 · 165 citations
Saturation numbers for families of Ramsey-minimal graphs
Guantao Chen, Michael Ferrara, Ronald J. Gould et al. · Journal of Combinatorics · 2011 · 15 citations · Full text
1–5 of 5
14
2
h-index
1
h-index
1 publications · 81 citations
1
h-index
National Institute of Advanced Industrial Science and Technology, Japan
1 publications · 10 citations
1
h-index
1 publications · 81 citations
1
h-index
1–5 of 14
10

University of Colorado Denver
Denver, United States
2 h-index
2 publications
28 citations

Middlebury College
Middlebury (village), United States
1 h-index
1 publications
15 citations
Russian Academy of Sciences
Moscow, Russia
1 h-index
3 publications
495 citations
University of Denver
Denver, United States
1 h-index
1 publications
15 citations
Georgia State University
Atlanta, United States
1 h-index
1 publications
15 citations
Emory University
Atlanta, United States
1 h-index
1 publications
15 citations

Georgia Southern University
Statesboro, United States
1 h-index
1 publications
15 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
2 publications
26 citations
1–8 of 10
2 publications · 175 citations
2
h-index
JOC · 1 publications · 15 citations
1
h-index
AJR · 1 publications · 81 citations
1
h-index
1 publications · 13 citations
1
h-index
1–4