Vertex-primitive digraphs with large fixity
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910751614042112 |
|---|---|
| author | Barbieri, Marco Potočnik, Primož |
| author_facet | Barbieri, Marco Potočnik, Primož |
| contents | 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 $1/3$, and we show that there are only finitely many vertex-primitive digraphs of bounded out-valency and relative fixity exceeding a positive constant. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_16590 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Vertex-primitive digraphs with large fixity Barbieri, Marco Potočnik, Primož Combinatorics Group Theory 05C25, 20B25 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 $1/3$, and we show that there are only finitely many vertex-primitive digraphs of bounded out-valency and relative fixity exceeding a positive constant. |
| title | Vertex-primitive digraphs with large fixity |
| topic | Combinatorics Group Theory 05C25, 20B25 |
| url | https://arxiv.org/abs/2309.16590 |