Hamilton cycles in dense vertex-transitive graphs

Details Hamilton cycles in dense vertex-transitive graphs Hamilton cycles in dense vertex-transitive graphs

2010-08-12

arxiv.org/abs/1008.2193v3

Mathematics

Combinatorics

24 pages, 5 figures; presentation improved thanks to suggestions of Deryk Osthus, some references added

Scientific paper

A famous conjecture of Lov\'asz states that every connected vertex-transitive
graph contains a Hamilton path. In this article we confirm the conjecture in
the case that the graph is dense and sufficiently large. In fact, we show that
such graphs contain a Hamilton cycle and moreover we provide a polynomial time
algorithm for finding such a cycle.

Affiliated with

Also associated with

No associations

Rating

Hamilton cycles in dense vertex-transitive graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamilton cycles in dense vertex-transitive graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton cycles in dense vertex-transitive graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587775