Goodness of trees for generalized books

S. A. Burr, P. Erdös, R. J. Faudree, C. C. Rousseau, R. H. Schelp, R. J. Gould, M. S. Jacobson

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalGraphs and Combinatorics
Volume3
Issue number1
DOIs
Publication statusPublished - Dec 1 1987

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Burr, S. A., Erdös, P., Faudree, R. J., Rousseau, C. C., Schelp, R. H., Gould, R. J., & Jacobson, M. S. (1987). Goodness of trees for generalized books. Graphs and Combinatorics, 3(1), 1-6. https://doi.org/10.1007/BF01788524