Name
Abstract | ||
|---|---|---|
Multicolor Ramsey numbers are given for some small, dense graphs. The lower bounds are established using constructions which can be nearly decomposed into vertex-disjoint copies of C 5 . |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0012-365X(88)90065-9 | Discrete Mathematics |
Keywords | Field | DocType |
ramsey number | Graph theory,Discrete mathematics,Graph,Combinatorics,Ramsey's theorem,Mathematics | Journal |
Volume | Issue | ISSN |
71 | 2 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.63 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Exoo | 1 | 187 | 39.86 |
| Donald F. Reynolds | 2 | 1 | 0.63 |