The tripartite Ramsey numbers rt(C4;2) and rt(C4;3)
© 2015, Forum-Editrice Universitaria Udinese SRL. All rigths reserved. The k-colored tripartite Ramsey numbers r t (G; k) is the smallest positive integer n such that any k-coloring of lines of a complete tripartite graph K n,n,n there always exists a monochromatic subgraph isomorphic to G. When G...
Saved in:
Main Authors: | S. Buada, D. Samana, V. Longani |
---|---|
Format: | Journal |
Published: |
2018
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84923085360&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/45725 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>;2) and r<inf>t</inf>(C<inf>4</inf>;3)
by: S. Buada, et al.
Published: (2018) -
Tripartite Ramsey number r
t(K
2,4, K
2,4)
by: Buada S., et al.
Published: (2014) -
Tripartite Ramsey number r t(K 2,4, K 2,4)
by: Buada S., et al.
Published: (2017) -
Tripartite Ramsey number r t(K 2,4, K 2,4)
by: Sasisophit Buada, et al.
Published: (2018) -
Tripartite Ramsey number r t(K 2,3,K 2,3)
by: S. Buada, et al.
Published: (2018)