On Ramsey graphs without bipartite subgraphs
暂无分享,去创建一个
Abstract We prove that for every graph H without triangles and K m , n , m , n ⩽ 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erdős and Faudree. Moreover we characterize all (edge-) Ramsey classes Forb( K m , n ).
[1] V. Rödl,et al. The Ramsey property for graphs with forbidden complete subgraphs , 1976 .
[2] Jaroslav Nesetril,et al. Strong Ramsey theorems for Steiner systems , 1987 .
[3] Jaroslav Nešetřil,et al. Simple proof of the existence of restricted ramsey graphs by means of a partite construction , 1981, Comb..
[4] J. Folkman. Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .