Paper Info
Title
All missing Ramsey numbers for trees versus the four-page book
Abstract
For the Ramsey number r(T-n, B-m), where Tn denotes a tree of order n and B-m denotes the m-page book K-2 + (K-m) over bar, it is known that r(T-n, B-m) = 2n-1 if n >= 3m - 3. In case of n < 3m - 3, r(T-n, B-m) has not been completely evaluated except for m <= 3. Here we determine the missing values of r(T-n, B-4). Our results close one gap in the table of the Ramsey numbers r(T-n, G) for all trees T-n and all connected graphs G of order six.
Year
DOI
Venue
2021
10.5614/ejgta.2021.9.2.10
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS
Keywords
DocType
Volume
Ramsey number, tree, book, small graph
Journal
9
Issue
ISSN
Citations 
2
2338-2287
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Roland Lortz100.68
Ingrid Mengersen200.68