Vertex-primitive digraphs with large fixity
Combinatorics
2024-12-20 v1 Group Theory
Abstract
The relative fixity of a digraph is defined as the ratio between the largest number of vertices fixed by a nontrivial automorphism of and the number of vertices of . We characterize the vertex-primitive digraphs whose relative fixity is at least , and we show that there are only finitely many vertex-primitive digraphs of bounded out-valency and relative fixity exceeding a positive constant.
Cite
@article{arxiv.2309.16590,
title = {Vertex-primitive digraphs with large fixity},
author = {Marco Barbieri and Primož Potočnik},
journal= {arXiv preprint arXiv:2309.16590},
year = {2024}
}
Comments
16 pages