Some results on the multipartite Ramsey numbers mj(C3,Cm,n1K2,n2K2,…,niK2)
The graph Kj×t is a graph which is complete and multipartite which includes j partite sets and t vertices in each partite set. The multipartite Ramsey number (M-R-number) mj(G1,G2,…,Gn) is the smallest integer t for the mentioned graphs G1,G2,…,Gn, in a way which for each n-edge-coloring (G1,G2,…,Gn...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-11-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844022027190 |