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 -edge-colouring of there is a monochromatic triple star of order at least , improving a previous result by Ruszink\'o. An edge colouring of a graph is called a local -colouring if every vertex spans edges of at most distinct colours. We prove the existence of a monochromatic triple star with at least vertices in every local -colouring of .
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}
}