Three Color Ramsey Numbers for Graphs with at most 4 Vertices

Electronic Journal Of Combinatorics

Luis Boza¹ 

关键词: Graph theory;    Extremal graphs;    Ramsey numbers;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

For given graphs $H_{1}, H_{2}, H_{3}$, the 3-color Ramsey number $R(H_{1},$ $H_{2}, H_{3})$ is the smallest integer $n$ such that if we arbitrarily color the edges of the complete graph of order $n$ with $3$ colors, then it always contains a monochromati

【 授权许可】

Others