Document Type
Lecture
Publication Date
4-22-2005
Abstract
Agraph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. Conjectures and results concerning both Ramsey saturated and unsaturated graphs will be presented. In particular, cycles and paths of order five or more will be shown to be unsaturated.
Relational Format
presentation
Recommended Citation
Schelp, R. H., "Ramsey Unsaturated and Saturated Graphs" (2005). Combinatorics Seminar. 93.
https://egrove.olemiss.edu/math_combinatorics/93
COinS