Size of Monochromatic Double Stars in Edge Colorings

  title={Size of Monochromatic Double Stars in Edge Colorings},
  author={Andr{\'a}s Gy{\'a}rf{\'a}s and G{\'a}bor N. S{\'a}rk{\"o}zy},
  journal={Graphs and Combinatorics},
We show that in every r -coloring of the edges of Kn there is a monochromatic double star with at least n(r+1)+r−1 r2 vertices. This result is sharp in asymptotic for r = 2 and for r ≥ 3 improves a bound of Mubayi for the largest monochromatic subgraph of diameter at most three. When r -colorings are replaced by local r -colorings, our bound is n(r+1)+r−1 r2+1 . 

From This Paper

Topics from this paper.
4 Citations
19 References
Similar Papers


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
  • 2001
1 Excerpt

Covering telement sets by partitions

  • A. Gyárfás Z. Füredi
  • Europ . J . Combinatorics
  • 1991

Similar Papers

Loading similar papers…