Ramsey minimal graphs
Ramsey minimal graphs
As usual, for graphs <FONT FACE=Symbol>G</font>, G, and H, we write <FONT FACE=Symbol>G ®</FONT> (G, H) to mean that any red-blue colouring of the edges of gamma contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey-infinite …