Vertex-transitive graphs that have no Hamilton decomposition
Combinatorics
2014-11-13 v3
Abstract
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.
Keywords
Cite
@article{arxiv.1408.5211,
title = {Vertex-transitive graphs that have no Hamilton decomposition},
author = {Darryn Bryant and Matthew Dean},
journal= {arXiv preprint arXiv:1408.5211},
year = {2014}
}
Comments
This version includes observations that some more of our graphs are Cayley graphs, and some revisions with new notation. It also includes some additional concluding remarks, and some updating of references