Acyclic edge colourings of graphs with large girth

Xing Shi Cai, Guillem Perarnau, Bruce Reed +1

An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $\epsilon >0$, there exists a $g=g(\var…