| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423531 | Discrete Mathematics | 2012 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Brian Alspach, Darryn Bryant, Danny Dyer,