Acyclic edge colourings of graphs with large girth
Abstract
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 girth at least g then G admits an acyclic edge colouring with at most (1+) colours.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.