Longer cycles in vertex transitive graphs

Matt DeVos

Longer cycles in vertex transitive graphs

Combinatorics 2023-02-09 v1

Authors: Matt DeVos

Abstract

In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on $n \ge 3$ vertices contains a cycle of length at least $\sqrt{3n}$ . Here we modify his approach to show that such graphs must contain a cycle of length at least $(1 - o(1))n^{3/5}$ .

Keywords

graph cycles

Cite

@article{arxiv.2302.04255,
  title  = {Longer cycles in vertex transitive graphs},
  author = {Matt DeVos},
  journal= {arXiv preprint arXiv:2302.04255},
  year   = {2023}
}

Comments

4 pages

Related papers

View all related →