Acyclic edge chromatic number of random d-regular graph is d+1

Publikace na Matematicko-fyzikální fakulta |

2005

The result stated in the title is proved, a technical extension of Kim-Vu result.