Name
Abstract | ||
|---|---|---|
With but a few exceptions, the Ramsey number r (G,T) is determined for all connected graphs G with at most five vertices and all trees T. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0012-365X(88)90200-2 | Discrete Mathematics |
Keywords | Field | DocType |
small order graph-tree,ramsey number | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Ramsey's theorem,Mathematics | Journal |
Volume | Issue | ISSN |
72 | 1-3 | Annals of Discrete Mathematics |
Citations | PageRank | References |
2 | 0.73 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| C. C. Rousseau | 2 | 126 | 22.97 |
| R. H. Schelp | 3 | 609 | 112.27 |