Vizing's Theorem: $\chi\prime(G) = \Delta \text{ or } \Delta+1$ \\ Where $\chi\prime(G)$ is the least $k$ for which a (loopless) graph $G$ has an edge $k$-colouring and $\Delta$ is the maximum vertex degree in $G$.