Abstract

AbstractWe prove that every connected vertex‐transitive graph on n ≥ 4 vertices has a cycle longer than (3n)1/2. The correct order of magnitude of the longest cycle seems to be a very hard question.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call