A note on two multicolor Ramsey numbers (Q2571307): Difference between revisions

The bulk of this paper consists of a presentation of a four-coloring of \(K_{26}\), which shows that 26 is a lower bound for \(R(K_3,K_4,C_3,C_3)\). A brief paragraph at the end uses a result of \textit{C. R. J. Clapham, A. Flockhart} and \textit{J. Sheehan} [J. Graph Theory 13, 29--47 (1989; Zbl 0679.05043)] to show that \(R_4(C_4)\leq 19\).