McGill University, Montreal



Acyclic edge colourings of graphs with large girth


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 ε > 0 there exists a g = g(ε) such that if G has maximum degree D and girth at least g then it admits an acyclic edge colouring with at most (1 + ε)D colours. This is a joint work with X. S. Cai, B. Reed and A. B. Watts.


The Catalan Mathematical Society invites participants to this first congress of a biannual series focusing on current research topics across several areas of Mathematics.

Plenary talks and thematic sessions have been selected by the Scientific Committee of the SCM. Special thanks are due to the organisers of the thematic sessions and to the local mathematical community as a whole for their support to this congress.


Societat Catalana de Matemàtiques
Institut d'Estudis Catalans
Carrer del Carme, 47
08001 Barcelona

Phone: +34 933 248 583

Download a poster (high res)

Download a poster (low res)