Ramsey-type results for Gallai colorings

  title={Ramsey-type results for Gallai colorings},
  author={Andr{\'a}s Gy{\'a}rf{\'a}s and G{\'a}bor N. S{\'a}rk{\"o}zy and Andr{\'a}s Seb{\"o} and Stanley M. Selkow},
  journal={Journal of Graph Theory},
A Gallai-coloring (G-coloring) is a generalization of 2-colorings of edges of complete graphs: a G-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Here we extend some results known earlier for 2-colorings to G-colorings. We prove that in every G-coloring of Kn there exists each of the following: 1. a monochromatic double star with at least 3n+1 4 vertices; 2. a monochromatic subgraph H such that all pairs of X ⊂ V (Kn) are at… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 19 references

Either a graph or its complement is connected: a continuing saga

  • A. Bialostocki, P. Dierker, W. Voxman
  • manuscript
  • 2001
1 Excerpt

Zs . Tuza , Perfect couples of graphs

  • G. Simonyi J. Körner
  • Combinatorica
  • 2000