Vertex-transitive graphs that have no Hamilton decomposition
classification
🧮 math.CO
keywords
graphscayleydecompositionhamiltonincludinginfinitelymanyvalency
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.