A connected graph G is said to be F-good if the Ramsey number r(F, G) is equal to (x(F) - 1)(p(G) - 1) + s(F), where s(F) is the minimum number of vertices in some color class under all vertex colorings byχ(F) colors. It is of interest to know which graphs F have the property that all trees are F-good. It is shown that any large tree is K(1, 1, m1, m2,..., mt)-good.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics