Bounds for Ramsey numbers in multipartite graphs

[摘要] ENGLISH ABSTRACT: The notion of a classical graph theoretic Ramsey number is generalized by assuming thatboth the original graph whose edges are arbitrarily bicoloured and the monochromaticsubgraphs to be forced are complete, balanced, multipartite graphs, instead of completegraphs as in the standard definition. Some small multipartite Ramsey numbers are found,while upper- and lower bounds are established for others. Analytic arguments as well ascomputer searches are used.

[发布机构] Stellenbosch University