Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/53700| Title: | The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| Authors: | S. Buada D. Samana V. Longani |
| Authors: | S. Buada D. Samana V. Longani |
| Keywords: | Mathematics |
| Issue Date: | 1-Jan-2014 |
| Abstract: | © 2015, Forum-Editrice Universitaria Udinese SRL. All rigths reserved. 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,nthere always exists a monochromatic subgraph isomorphic to G. When G is C4it is known, but unpublished in a journal, that rt(C4; 2) = 3. In this paper we simplify the proof of rt(C4; 2) = 3 and show the new result that rt(C4; 3) = 7. |
| URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84923085360&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53700 |
| ISSN: | 11268042 |
| Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.