Ramsey (K_(1,2), C_4)- minimal Graphs

摘要

For any given graphs G and H, we write F → (G, H) to mean that any red-blue coloring of the edges of F contains a red copy of G or a blue copy of H. Graph F is (G, H)-minimal (Ramsey-minimal) if F → (G, H) but F~* → (G, H) for any proper subgraph F~* C F.