Diagonal ramsey numbers in multipartite graphs

Authors

  • Burger A.P.
  • Grobler P.J.P.
  • Stipp E.H.
  • Van Vuuren J.H.

Abstract

The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi-coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds are established for others. Analytic arguments as well as computer searches are employed.

Published

2004-06-09

How to Cite

Burger A.P., Grobler P.J.P., Stipp E.H., & Van Vuuren J.H. (2004). Diagonal ramsey numbers in multipartite graphs. Utilitas Mathematica, 66. Retrieved from http://utilitasmathematica.com/index.php/Index/article/view/324

Issue

Vol. 66 (2004): Volume 66, 2004

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.