On Multicolor Ramsey Numbers for Complete Bipartite Graphs

@inproceedings{CHTJNG2003OnMR,
  title={On Multicolor Ramsey Numbers for Complete Bipartite Graphs},
  author={FAN R. K. CHTJNG},
  year={2003}
}
  • FAN R. K. CHTJNG
  • Published 2003
It follows from a well-known theorem of Ramsey [7] that for any finite graph G and any positive integer k, there exists a least integer r(G; k) which has the following property. Any k-coloring of the edges of the complete graph KV on Y edges always has a monochromatic subgraph isomorphic to G, provided only that Y > r(G; k). Most work up to now has dealt with the case k = 2. The reader is invited to read Burr [2] for an excellent survey of the current state of affairs on this subject. In this… CONTINUE READING