Tripartite Ramsey number r t(K 2,3,K 2,3)
A graph G is n - partite, n ≥ 1, if it is possible to partition the set of points V (G) into n subsets V 1 , V 2 , ..., V n (called partite sets) such that every element of the set of lines E(G) joins a point of Vi to a poin...
Saved in:
Main Authors: | Buada S., Longani V. |
---|---|
Format: | Journal |
Published: |
2017
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867285817&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42748 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Tripartite Ramsey number r t(K 2,3,K 2,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: (2017) -
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: Sasisophit Buada, et al.
Published: (2018) -
The tripartite Ramsey numbers rt(C4;2) and rt(C4;3)
by: S. Buada, et al.
Published: (2018)