Paley graphs have Hamilton decompositions

We prove that all Paley graphs can be decomposed into Hamilton cycles.

► We prove that all Paley graphs can be decomposed into Hamilton cycles. ► The proof depends crucially on the classical Edmonds-Fulkerson matroid partition theorem. ► The structure of finite fields is the other essential element of the proof.