We prove that for every graph H without triangles and K(m,n), m, n less-than-or-equal-to 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erdos and Faudree. Moreover we characterize all (edge-) Ramsey classes Forb(K(m,n)).
机构:
Qinghai Normal Univ, Sch Math & Statistis, Xining 810008, Qinghai, Peoples R ChinaQinghai Normal Univ, Sch Math & Statistis, Xining 810008, Qinghai, Peoples R China
Ma, Zhiqiang
Mao, Yaping
论文数: 0引用数: 0
h-index: 0
机构:
Qinghai Normal Univ, Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R ChinaQinghai Normal Univ, Sch Math & Statistis, Xining 810008, Qinghai, Peoples R China
Mao, Yaping
Schiermeyer, Ingo
论文数: 0引用数: 0
h-index: 0
机构:
Tech Univ, Inst Diskrete Math & Algebra, Bergakad Freiberg, D-09596 Freiberg, GermanyQinghai Normal Univ, Sch Math & Statistis, Xining 810008, Qinghai, Peoples R China
Schiermeyer, Ingo
Wei, Meiqin
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Maritime Univ, Coll Arts & Sci, Shanghai 201306, Peoples R ChinaQinghai Normal Univ, Sch Math & Statistis, Xining 810008, Qinghai, Peoples R China