Matching-star Ramsey sets Original Research Article

The Ramsey set R(G,H) consists of all graphs F with F→(G,H) and F′↛(G,H) for every proper subgraph F′ of F. In this paper we will characterize the graphs belonging to R(2K2,K1,n) with n⩾3 and determine R(2K2,K1,n) for n⩽3 explicitly.