All missing Ramsey numbers for trees versus the four-page book
For the Ramsey number r(Tn, Bm), where Tn denotes a tree of order n and Bm denotes the m-page book K2 + bar(K)m, it is known that r(Tn, Bm)=2n − 1 if n ≥ 3m − 3. In case of n < 3m − 3, r(Tn, Bm) has not been completely evaluated except for m ≤ 3. Here we determine the missing values of r(Tn, B4)....
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |