English

Transitivity conditions in infinite graphs

Combinatorics 2009-10-30 v1

Abstract

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all k3k \geq 3, the kk-CS-transitive such graphs.

Keywords

Cite

@article{arxiv.0910.5651,
  title  = {Transitivity conditions in infinite graphs},
  author = {Matthias Hamann and Julian Pott},
  journal= {arXiv preprint arXiv:0910.5651},
  year   = {2009}
}

Comments

20 pages

R2 v1 2026-06-21T14:04:55.887Z