1 paper · 1 filter
Oliver Janzer, Fredy Yip
It is easy to see that every k-edge-colouring of the complete graph on 2k+1 vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smalle…