On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
DOI10.1016/j.ejc.2021.103404zbMath1471.05120arXiv2003.07200OpenAlexW3193464356MaRDI QIDQ1979440
Publication date: 2 September 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.07200
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Finite nilpotent groups, (p)-groups (20D15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Group actions on combinatorial structures (05E18)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing \(p\)-groups via Jordan algebras.
- The occurrence of finite groups in the automorphism group of nilpotent groups of class 2
- The asymptotic spectrum of graphs and the Shannon capacity
- Mekler's construction and generalized stability
- On the automorphism groups of strongly regular graphs I
- The asymptotic spectrum of tensors.
- Stability of nilpotent groups of class 2 and prime exponent
- Singular spaces of matrices and their application in combinatorics
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
- Group-theoretic generalisations of vertex and edge connectivities
- Graph isomorphism in quasipolynomial time [extended abstract]
- Groups with Abelian Central Quotient Group
- The Factorization of Linear Graphs
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
This page was built for publication: On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
