Edge coloring regular graphs of high degree Original Research Article

We discuss the following conjecture: If G = (V, E) is a Δ-regular simple graph with an even number of vertices at most 2Δ then G is Δ edge colorable. In this paper we show that the conjecture is true for large graphs if | V | < (2 − ε)Δ. We discuss the related results.