Long cycles in vertex‐transitive graphs

Author:

Abstract
We 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.

This publication has 7 references indexed in Scilit: