Name
Abstract | ||
|---|---|---|
A connected graphG is said to beF-good if the Ramsey numberr(F, G) is equal to(x(F) ¿ 1)(p(G) ¿ 1) + s(F), wheres(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 graphsF have the property that all trees areF-good. It is shown that any large tree isK(1, 1,m 1,m 2,...,m t )-good. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/BF01788524 | Graphs and Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Mathematics | Journal | 3 |
Issue | ISSN | Citations |
1 | 0911-0119 | 8 |
PageRank | References | Authors |
1.98 | 3 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. A. Burr | 1 | 48 | 10.83 |
| P Erdös | 2 | 626 | 190.85 |
| R. J. Faudree | 3 | 174 | 38.15 |
| C. C. Rousseau | 4 | 126 | 22.97 |
| R. H. Schelp | 5 | 609 | 112.27 |
| R. J. Gould | 6 | 8 | 1.98 |
| M. S. Jacobson | 7 | 198 | 40.79 |