The value of the Ramsey number R4(C4)
Abstract
The multicolor Ramsey number Rr(H) is defined to be the smallest integer n = n(r) with the property that any r-coloring of the edges of the complete graph Kn must result in a monochromatic subgraph of K n isomorphic to H. It is well known that 18 ≤ R4[C 4) ≤ 19. In this paper, with the help of a substantial amount of computation, we prove that R4(C4) = 18.
Published
2007-06-09
How to Cite
Sun, Yongqi, Yang, Yuansheng, Lin, Xiaohui, & Zheng, Wenping. (2007). The value of the Ramsey number R4(C4). Utilitas Mathematica, 73. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/481
Issue
Section
Articles