Edge-transitive cubic graphs: Cataloguing and Enumeration
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910813918330880 |
|---|---|
| author | Conder, Marston Potočnik, Primož |
| author_facet | Conder, Marston Potočnik, Primož |
| contents | This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these divide respectively into $7$ types (according to a classification by Djoković and Miller (1980)) and $15$ types (according to a classification by Goldschmidt(1980)), in terms of certain group amalgams. Such graphs of small order were previously known up to orders $2048$ and $768$, respectively, and we have extended each of the two lists of all such graphs up to order $10000$. Before describing how we did that, we carry out an analysis of the $22$ amalgams, to show which of the finitely-presented groups associated with the $15$ Goldschmidt amalgams can be faithfully embedded in one or more of the other $21$ (as subgroups of finite index), complementing what is already known about such embeddings of the $7$ Djoković-Miller groups in each other. We also give an example of a graph of each of the $22$ types, and in most cases, describe the smallest such graph, and we then use regular coverings to prove that there are infinitely many examples of each type. Finally, we discuss the asymptotic enumeration of the graph orders, proving that if $f_{\mathcal C}(n)$ is the number of cubic edge-transitive graphs of type ${\mathcal C}$ on at most $n$ vertices, then there exist positive real constants $a$ and $b$ and a positive integer $n_0$ such that $n^{a \log(n)} \le f_{\mathcal C}(n) \le n^{b \log(n)}$ for all $\ n\ge n_0$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_02250 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Edge-transitive cubic graphs: Cataloguing and Enumeration Conder, Marston Potočnik, Primož Combinatorics 20B25 This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these divide respectively into $7$ types (according to a classification by Djoković and Miller (1980)) and $15$ types (according to a classification by Goldschmidt(1980)), in terms of certain group amalgams. Such graphs of small order were previously known up to orders $2048$ and $768$, respectively, and we have extended each of the two lists of all such graphs up to order $10000$. Before describing how we did that, we carry out an analysis of the $22$ amalgams, to show which of the finitely-presented groups associated with the $15$ Goldschmidt amalgams can be faithfully embedded in one or more of the other $21$ (as subgroups of finite index), complementing what is already known about such embeddings of the $7$ Djoković-Miller groups in each other. We also give an example of a graph of each of the $22$ types, and in most cases, describe the smallest such graph, and we then use regular coverings to prove that there are infinitely many examples of each type. Finally, we discuss the asymptotic enumeration of the graph orders, proving that if $f_{\mathcal C}(n)$ is the number of cubic edge-transitive graphs of type ${\mathcal C}$ on at most $n$ vertices, then there exist positive real constants $a$ and $b$ and a positive integer $n_0$ such that $n^{a \log(n)} \le f_{\mathcal C}(n) \le n^{b \log(n)}$ for all $\ n\ge n_0$. |
| title | Edge-transitive cubic graphs: Cataloguing and Enumeration |
| topic | Combinatorics 20B25 |
| url | https://arxiv.org/abs/2502.02250 |