Vertex-primitive digraphs with large fixity
Marco Barbieri, and Primo\v{z} Poto\v{c}nik

TL;DR
This paper characterizes vertex-primitive digraphs with high relative fixity, showing finiteness results for those with bounded out-valency and fixity above a positive threshold.
Contribution
It provides a complete characterization of vertex-primitive digraphs with relative fixity at least 1/3 and establishes finiteness for those with bounded out-valency and high fixity.
Findings
Vertex-primitive digraphs with relative fixity ≥ 1/3 are characterized.
Finitely many such digraphs exist with bounded out-valency and fixity above a positive constant.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Cooperative Communication and Network Coding · Finite Group Theory Research
