Complete graphs with no rainbow path

  • Authors:
  • Andrew Thomason;Peter Wagner

  • Affiliations:
  • DPMMS, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, United Kingdom;DPMMS, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, United Kingdom

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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