David Conlon, Mykhaylo Tyomkyn
Published 2021-09-06Version 1
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.
Nim on the Complete Graph
On triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph
On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs
![QR code for arXiv:2109.02633 [math.CO]](http://oss.arxitics.com/images/favicon.svg)