Name
Abstract | ||
|---|---|---|
Motivated by questions in Ramsey theory, we consider colorings of the edges of the complete graph Kn that contain no rainbow path Pt+1 of length t. If fewer than t colors are used then certainly there is no rainbow Pt+1. We show that, if at least t colors are used, then very few colorings are possible if t ≤ 5 and these can be described precisely, whereas the situation for t ≥ 6 is qualitatively different. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 261–266, 2007 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/jgt.v54:3 | Journal of Graph Theory |
Keywords | Field | DocType |
complete graph | Ramsey theory,Graph theory,Discrete mathematics,Complete graph,Graph,Combinatorics,Gallai–Hasse–Roy–Vitaver theorem,Rainbow,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
54 | 3 | 0364-9024 |
Citations | PageRank | References |
7 | 0.69 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Thomason | 1 | 71 | 16.01 |
| Peter Wagner | 2 | 7 | 0.69 |