English

Large monochromatic triple stars in edge colourings

Combinatorics 2013-10-18 v1

Abstract

Following problems posed by Gy\'arf\'as, we show that for every rr-edge-colouring of KnK_n there is a monochromatic triple star of order at least n/(r1)n/(r-1), improving a previous result by Ruszink\'o. An edge colouring of a graph is called a local rr-colouring if every vertex spans edges of at most rr distinct colours. We prove the existence of a monochromatic triple star with at least rn/(r2r+1)rn/(r^2-r+1) vertices in every local rr-colouring of KnK_n.

Keywords

Cite

@article{arxiv.1310.4666,
  title  = {Large monochromatic triple stars in edge colourings},
  author = {Shoham Letzter},
  journal= {arXiv preprint arXiv:1310.4666},
  year   = {2013}
}