Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles

Abstract

We show that every complete graph $K_n$, with an edge-colouring without monochromatic triangles, has a properly coloured Hamiltonian path.