Vertex-primitive digraphs with large fixity
arXiv:2309.16590 · doi:10.1007/s10231-024-01447-x
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.
16 pages