Large monochromatic triple stars in edge colourings

Abstract

Following problems posed by Gy\'arf\'as, we show that for every r-edge-colouring of Kn there is a monochromatic triple star of order at least n/(r-1), improving a previous result by Ruszink\'o. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…