Minimal vertex Ramsey graphs and minimal forbidden subgraphs
Let \(G,F\) and \(H\) be graphs. Then \(G\) is \((F,H)\)-Ramsey minimal if any colouring of the edges of \(G\) in red and blue yields a blue copy of \(F\) or a red copy of \(H\), but no proper subgraph of \(G\) has this property. This paper gives two equivalent theorems which characterize the \(K_{1,2}, K_{1,m}\) Ramsey minimal graphs.
scientific article; zbMATH DE number 2105607