Affiliation:
1. University of Colombo, Sri Lanka
Abstract
A popular area of graph theory is based on a paper written in 1930 by F. P. Ramsey titled “On a Problem on Formal Logic.” A theorem which was proved in his paper triggered the study of modern Ramsey theory. However, his premature death at the young age of 26 hindered the development of this area of study at the initial stages. The balanced size multipartite Ramsey number mj (H,G) is defined as the smallest positive number s such that Kj×s→ (H,G). There are 36 pairs of (H, G), when H, G represent connected graphs on four vertices (as there are only 6 non-isomorphic connected graphs on four vertices). In this chapter, the authors find mj (H, G) exhaustively for all such pairs in the tripartite case j=3, and in the quadpartite case j=4, excluding the case m4 (K4,K4). In this case, the only known result is that m4 (K4,K4) is greater than or equal to 4, since no upper bound has been found as yet.
Reference11 articles.
1. Angeltveit, V., & Mckay, B. D. (2017). R(5, 5) ≤ 48. arXiv:1703.08768
2. On a Conjecture Involving Cycle-Complete Graph Ramsey Numbers;B.Bollobas;The Australasian Journal of Combinatorics,2000
3. Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers
4. A lower bound for r(5, 5)
5. On a Ramsey problem involving the 3-Pan Graph.;C. J.Jayawardene;Annals of Pure and Applied Mathematics,2018