Loading...
A note on the tripartite ramsey numbers rt(C4;2) AND rt(C4;3)
Author(s)
Date Issued
January 1, 2015
Type
Article
Abstract
The k-colored tripartite Ramsey numbers rt(G; k) is the smallest positive integer n such that any k-coloring of lines of a complete tripartite graph Kn,n,n there always exists a monochromatic subgraph isomorphic to G. The values of rt(C4; 2) = 3, and rt(C4;3) = 7 are discussed in the article The tripartite Ramsey numbers rt(C4; 2) and rt(C4;3) of the Italian Journal of Pure and Applied Mathematics, n. 33-2014. However, there are our technical mistakes on three figures of the article. In this note we correct these mistakes.
Citation
Italian Journal of Pure and Applied Mathematics, 515-517, 2015