Name
Abstract | ||
|---|---|---|
The multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of the edges of the complete graph Kn must produce a monochromatic 4-cycle. It was proved earlier that rk(C4)⩾k2−k+2 for k−1 being a prime power. In this note we establish rk(C4)⩾k2+2 for k being an odd prime power. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1006/jctb.2000.1954 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
edge coloring,monochromatic graph,multicolor Ramsey number,edge decomposition,polarity graph | Integer,Discrete mathematics,Edge coloring,Complete graph,Combinatorics,Circulant graph,Monochromatic color,Clebsch graph,Ramsey's theorem,Prime power,Mathematics | Journal |
Volume | Issue | ISSN |
79 | 2 | 0095-8956 |
Citations | PageRank | References |
5 | 0.61 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Felix Lazebnik | 1 | 353 | 49.26 |
| Andrew J. Woldar | 2 | 88 | 11.20 |