Improved bounds on acyclic edge colouring

We prove that the acyclic chromatic index image for all graphs with girth at least image. We extend the same method to obtain a bound of image with the girth requirement image. We also obtain a relationship between image and image.