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 point of V...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867285817&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51785 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
Be the first to leave a comment!