Paley graphs have Hamilton decompositions

doi:10.1016/j.disc.2011.06.003

Discrete Mathematics

Volume 312, Issue 1, 6 January 2012, Pages 113-118

This paper is dedicated to Gert Sabidussi in celebration of his 80th birthday

https://doi.org/10.1016/j.disc.2011.06.003 Get rights and content

Under an Elsevier user license

open archive

Abstract

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

Highlights

► 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.

Keywords

Hamilton cycle

Hamilton decomposition

Paley graph