Title of article
Matching-star Ramsey sets Original Research Article
Author/Authors
Ingrid Mengersen، نويسنده , , J?rg Oeckermann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
8
From page
417
To page
424
Abstract
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.
Keywords
Ramsey-minimal graphs , Finite Ramsey sets
Journal title
Discrete Applied Mathematics
Serial Year
1999
Journal title
Discrete Applied Mathematics
Record number
884961
Link To Document