Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777448 | European Journal of Combinatorics | 2017 | 9 Pages |
Abstract
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. It is natural to ask whether this is true for all finitely presented Cayley graphs, but the answer turns out to be negative (de la Salle and Tessera, 2015).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Agelos Georgakopoulos,