The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3)
© 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 C4...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84923085360&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53700 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-53700 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-537002018-09-04T09:55:53Z The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) S. Buada D. Samana V. Longani Mathematics © 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. 2018-09-04T09:55:53Z 2018-09-04T09:55:53Z 2014-01-01 Journal 11268042 2-s2.0-84923085360 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84923085360&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53700 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics S. Buada D. Samana V. Longani The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| description |
© 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. |
| format |
Journal |
| author |
S. Buada D. Samana V. Longani |
| author_facet |
S. Buada D. Samana V. Longani |
| author_sort |
S. Buada |
| title |
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| title_short |
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| title_full |
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| title_fullStr |
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| title_full_unstemmed |
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3) |
| title_sort |
tripartite ramsey numbers r<inf>t</inf>(c<inf>4</inf>;2) and r<inf>t</inf>(c<inf>4</inf>;3) |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84923085360&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53700 |
| _version_ |
1681424184064868352 |