English

On rotarily transitive graphs

Combinatorics 2016-12-06 v2 Group Theory Metric Geometry

Abstract

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall that Cayley graphs can be defined as non-empty locally finite connected graphs endowed with a transitive group action such that any non-identity element acts without fixed point. We define a class of transitive graphs which are transitive in an "absolutely non-Cayley way": we consider graphs endowed with a transitive group action such that any element of the group acts with a fixed point. We call such graphs "rotarily transitive graphs", and we show that, even though there is no finite rotarily transitive graph with at least 2 vertices, there is an infinite locally finite connected rotarily transitive graph. The proof is based on groups built by Ivanov which are finitely generated, of finite exponent and have a small number of conjugacy classes. We also build infinite transitive graphs (which are not locally finite) any automorphism of which has a fixed point. This is done by considering "unit distance graphs" associated with the projective plane over suitable subfields of the real numbers.

Keywords

Cite

@article{arxiv.1605.06054,
  title  = {On rotarily transitive graphs},
  author = {Sébastien Martineau},
  journal= {arXiv preprint arXiv:1605.06054},
  year   = {2016}
}
R2 v1 2026-06-22T14:04:53.143Z