1 paper
Matt DeVos, Matthew Drescher, Daryl Funk +5
Let G be a simple n-vertex graph and c be a colouring of E(G) with n colours, where each colour class has size at least 2. We prove that (G,c) contains a rainbow cycl…