Long cycles in vertex‐transitive graphs
Author:
- 1 September 1979
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 3 (3) , 301-304
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.Keywords
This publication has 7 references indexed in Scilit:
- On the Complexity of Canonical Labeling of Strongly Regular GraphsSIAM Journal on Computing, 1980
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Chromatic number and subgraphs of cayley graphsLecture Notes in Mathematics, 1978
- On defect-d matchings in graphsDiscrete Mathematics, 1975
- Three Remarkable GraphsCanadian Journal of Mathematics, 1973
- Eine Eigenschaft der Atome endlicher GraphenArchiv der Mathematik, 1971
- Connectivity of transitive graphsJournal of Combinatorial Theory, 1970