Diagonal Ramsey numbers in multipartite graphs
Year: 2004
Type: article
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.
Source: Utilitas Mathematica
Authors: Burger Ap, Grobler Pjp, Stipp Eh, Jan H. van Vuuren
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W766986082
