Large Monochromatic Triple Stars in Edge Colourings. Issue 4 (19th January 2015) - Letzter, Shoham
Abstract Following problems posed by Gyárfás 2011, we show that for every r‐edge‐colouring of Kn there is a monochromatic triple star of order at least n/(r−1), improving Ruszinkó's result 2012. An edge colouring of a graph is called a local r‐colouring if every vertex spans edges of at most r distinct colours. We prove the existence of a monochromatic triple star with at least rn/(r2−r+1) vertices in every local r‐colouring of Kn.