A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
On Ramsey unsaturated and saturated graphs
2010
The Australasian Journal of Combinatorics
Preserved Fulltext
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. This has been studied by Balister, Lehel and Schelp [J. Graph Theory 51 (2006), 22-32]. In this paper, we show that some circulant graphs, trees with diameter 3, and K t,n ∪ mK 1 for infinitely many t, n and m, are Ramsey unsaturated.
dblp:journals/ajc/Ho10
fatcat:wdgzp7h2xbehfdxweswg643qvq