Multipartite Ramsey numbers

David Day, Wayne Goddard, Michael A. Henning, Henda C. Swart

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)


For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey number rck(G) as the minimum value m such that, given any colouring using c colours of the edges of the complete balanced k-partite graph with m vertices in each partite set, there must exist a monochromatic copy of G. We show that the question of the existence of rck(G) is tied up with what monochromatic subgraphs are forced in a c-colouring of the complete graph Kk. We then calculate the values for some small G including r23 (C4) = 3, r24(C4) = 2, r33(C4) = 7 and r23(C6) = 3.

Original languageEnglish
Pages (from-to)23-31
Number of pages9
JournalArs Combinatoria
Publication statusPublished - Jan 2001
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Multipartite Ramsey numbers'. Together they form a unique fingerprint.

Cite this