Tripartite Ramsey number r t(K 2,4, K 2,4)
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 V i to a point of V j, i ≠ j. For n = 2, and n = 3 such graphs are called bipartite graph, an...
Saved in:
Main Authors: | Buada S., Longani V. |
---|---|
Format: | Article |
Language: | English |
Published: |
2014
|
Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84864125348&partnerID=40&md5=735d19276225db851334ccacb07708e1 http://cmuir.cmu.ac.th/handle/6653943832/6818 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Language: | English |
Similar Items
-
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) -
Tripartite Ramsey number r t(K 2,3,K 2,3)
by: Buada S., et al.
Published: (2017) -
The tripartite Ramsey numbers rt(C4;2) and rt(C4;3)
by: S. Buada, et al.
Published: (2018)