The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSciOnDemand powered search:

Tripartite and Quadpartite Size Ramsey Numbers for All Pairs of Connected Graphs on Four Vertices

Author(s): Chula J. Jayawardene (University of Colombo, Sri Lanka)
Copyright: 2020
Pages: 16
Source title:
Handbook of Research on Advanced Applications of Graph Theory in Modern Society
Source Author(s)/Editor(s): Madhumangal Pal (Vidyasagar University, India), Sovan Samanta (Tamralipta Mahavidyalaya, India) and Anita Pal (National Institute of Technology Durgapur, India)
DOI: 10.4018/9781522593805.ch010
Purchase

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 nonisomorphic 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.
Related Content
Arunaben Prahladbhai Gurjar, Shitalben Bhagubhai Patel.
© 2022.
30 pages.

Meghna Babubhai Patel, Jagruti N. Patel, Upasana M. Bhilota.
© 2022.
10 pages.

Vo Ngoc Phu, Vo Thi Ngoc Tran.
© 2022.
27 pages.

Steven Walczak.
© 2022.
17 pages.

Priyanka P. Patel, Amit R. Thakkar.
© 2022.
26 pages.

Vo Ngoc Phu, Vo Thi Ngoc Tran.
© 2022.
34 pages.

Sarat Chandra Nayak, Subhranginee Das, Bijan Bihari Misra.
© 2022.
20 pages.


