Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vertex-transitive graphs that have no Hamilton decomposition

Published 22 Aug 2014 in math.CO | (1408.5211v3)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Darryn Bryant 
  2. Matthew Dean 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up