Presentations for Vertex Transitive Graphs
From MaRDI portal
Publication:6344979
arXiv2007.06432MaRDI QIDQ6344979FDOQ6344979
Authors: Agelos Georgakopoulos, Matthias Hamann, Alex Wendland 
Publication date: 13 July 2020
Abstract: We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex transitive graph. As an intermediate step, we prove that every countably infinite, connected, vertex transitive graph has a perfect matching. Incidentally, we construct an example of a 2-ended cubic vertex transitive graph which is not a Cayley graph, answering a question of Watkins from 1990.
Group actions on combinatorial structures (05E18) Combinatorial aspects of groups and algebras (05E16) Foundations (20A99)
This page was built for publication: Presentations for Vertex Transitive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344979)
