Premium
Long cycles in vertex‐transitive graphs
Author(s) -
Babai László
Publication year - 1979
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190030314
Subject(s) - combinatorics , mathematics , vertex (graph theory) , transitive relation , graph , discrete mathematics
We prove that every connected vertex‐transitive graph on n ≥ 4 vertices has a cycle longer than (3 n ) 1/2 . The correct order of magnitude of the longest cycle seems to be a very hard question.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom