Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques

Andrey Grinshpun, Raj Raina, Rik Sengupta

Abstract: For graphs F and H, we say F is Ramsey for H if every 2-coloring of the edges of F contains a monochromatic copy of H. The graph F is Ramsey H-minimal if F is Ramsey for H and there is no proper subg...