We prove that there exist graphs G with arbitrarily large girth such that every proper edge coloring of G contains a rainbow cycle (i.e., a cycle having no pair of monochromatic edges). This answers a problem raised by J. Spencer more than 10 years ago.
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics