David Conlon, Mykhaylo Tyomkyn·2021-09-07·via math.CO updates on arXiv.org
We show that every two-colouring of the edges of the complete graph $K_n$ contains a monochromatic trail or circuit of length at least $2n^2/9 +o(n^2)$, which is asymptotically best possible.