Stabilizers of consistent walks
Combinatorics
2024-05-28 v1
Abstract
A walk of length in a graph is consistent if there exists an automorphism of the graph that maps the initial vertices to the final vertices of the walk. In this paper we find some sufficient conditions for a consistent walk in an arc-transitive graph to have a trivial pointwise stabilizer. We show that in that case, the size of the smallest generating set of the group is bounded by the valence of the graph.
Cite
@article{arxiv.2405.16691,
title = {Stabilizers of consistent walks},
author = {Maruša Lekše},
journal= {arXiv preprint arXiv:2405.16691},
year = {2024}
}