Asymptotic enumeration of graphical regular representations
From MaRDI portal
Publication:6139774
DOI10.1112/plms.12563zbMath1529.20040arXiv2212.01875OpenAlexW4387016268MaRDI QIDQ6139774
Publication date: 19 December 2023
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01875
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group actions on combinatorial structures (05E18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Automorphisms of Cayley graphs on generalised dicyclic groups
- Normal Cayley graphs of finite groups
- Finite digraphs with given regular automorphism groups
- On the automorphism groups of almost all Cayley graphs
- On the full automorphism group of a graph
- Automorphism groups and isomorphisms of Cayley digraphs
- Cayley graphs on abelian groups
- On the existence of Frobenius digraphical representations
- On primitive overgroups of quasiprimitive permutation groups
- On the existence of graphical Frobenius representations and their asymptotic enumeration
- Asymptotic enumeration of Cayley digraphs
- On the asymptotic enumeration of Cayley graphs
- Vertex-transitive graphs
- On the action of non-Abelian groups on graphs
- On the equivalence between a conjecture of Babai-Godsil and a conjecture of Xu concerning the enumeration of Cayley graphs
- On the non-existence of graphs with transitive generalized dicyclic groups
- On a Theorem of Sabidussi
- Enumerating boundedly generated finite groups.
- Finite transitive groups having many suborbits of cardinality at most 2 and an application to the enumeration of Cayley graphs
This page was built for publication: Asymptotic enumeration of graphical regular representations