Name
Abstract | ||
|---|---|---|
The Ramsey numberr(F, G) is determined in the case whereF is an arbitrary fixed graph andG is a sufficiently large sparse connected graph with a restriction on the maximum degree of its vertices. An asymptotically
correct upper bound is obtained forr(F, T) whereT is a sufficiently large, but otherwise arbitrary, tree. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1007/BF02579245 | Combinatorica |
Keywords | DocType | Volume |
multipartite graph-sparse gra,j ramsey number,05 C 55 | Journal | 5 |
Issue | ISSN | Citations |
4 | 0209-9683 | 9 |
PageRank | References | Authors |
1.60 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| R. J. Faudree | 2 | 174 | 38.15 |
| C. C. Rousseau | 3 | 126 | 22.97 |
| R. H. Schelp | 4 | 609 | 112.27 |