On Induced Colourful Paths in Triangle-free Graphs

Jasine Babu, Manu Basavaraju, L. Sunil Chandran +1

Given a graph $G=(V,E)$ whose vertices have been properly coloured, we say that a path in $G$ is "colourful" if no two vertices in the path have the same colour. It is a corollary…