文章基本信息

标题：Generalized Ramsey numbers for paths in <mml:math alttext="$2$" xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mn>2</mml:mn></mml:math>-chromatic graphs
本地全文：下载
作者：R. Meenakshi ; P. S. Sundararaghavan
期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：1986
卷号：9
DOI：10.1155/S0161171286000339
出版社：Hindawi Publishing Corporation
摘要：Chung and Liu have defined the d-chromatic Ramsey number as follows. Let 1≤d≤c and let t=(cd). Let 1,2,…,t be the ordered subsets of d colors chosen from c distinct colors. Let G1,G2,…,Gt be graphs. The d-chromatic Ramsey number denoted by rdc(G1,G2,…,Gt) is defined as the least number p such that, if the edges of the complete graph Kp are colored in any fashion with c colors, then for some i, the subgraph whose edges are colored in the ith subset of colors contains a Gi. In this paper it is shown that r23(Pi,Pj,Pk)=[(4k