Edge colorings of complete graphs without tricolored triangles

  • Authors:

  • András Gyárfás;Gábor Simony

  • Affiliations:

  • Computer and Automation Research Institute, of the Hungarian Academy of Sciences, Budapest, P.O. Box 63, 1518, Hungary;Alfred Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, P.O. Box 127, 1364, Hungary

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size of largest monochromatic stars guaranteed to occur. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 211–216, 2004