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: | , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2017
|
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867285817&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42748 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|