Schreir graphs: Transitivity and coverings

DOI10.1142/S021819671650003XzbMath1332.05071arXiv1505.03433MaRDI QIDQ2796978

Paul-Henry Leemann

Publication date: 30 March 2016

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03433

zbMATH Keywords

coveringsvertex-transitivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Up to a double cover, every regular connected graph is isomorphic to a Schreier graph ⋮ Presentations for vertex-transitive graphs ⋮ On Schreier graphs of gyrogroup actions ⋮ On groups and simplicial complexes ⋮ Cayley graphs with few automorphisms ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ Furstenberg entropy of intersectional invariant random subgroups

Cites Work

• Unnamed Item
• On invariant Schreier structures
• On a Class of Fixed-Point-Free Graphs

This page was built for publication: Schreir graphs: Transitivity and coverings