A NOTE ON THE TRIPARTITE RAMSEY NUMBERS \(r_t\)(\(C_4;2)\) AND \(r_t\)(\(C_4;3)\)

Authors

  • S. Buada Nakhon Sawan Rajabhat University - Department of Science
  • D. Samana King Mongkut's Institute of Technology Ladkrabang - Department of Mathematics
  • V. Longani Chiang Mai University - Department of Mathematics

Keywords:

tripartite Ramsey numbers, bipartite Ramsey numbers, Ramsey numbers, tripartite graphs

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.

Cover of n°34 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2015-06-30

How to Cite

Buada, S., Samana, D., & Longani, V. (2015). A NOTE ON THE TRIPARTITE RAMSEY NUMBERS \(r_t\)(\(C_4;2)\) AND \(r_t\)(\(C_4;3)\). Italian Journal of Pure and Applied Mathematics, 34, 515–517. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6313

Issue

N°34 - June 2015

Section

Articoli - Forum Editrice

License

Copyright (c) 2015 S. Buada, D. Samana, V. Longani

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

L'opera è pubblicata sotto  Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

Similar Articles

<< < 1 2 3 > >> 

You may also start an advanced similarity search for this article.