A Conjecture Concerning a Limit of Non-Cayley Graphs Authors
Cite this article as: Diestel, R. & Leader, I. Journal of Algebraic Combinatorics (2001) 14: 17. doi:10.1023/A:1011257718029 Abstract
Our aim in this note is to present a transitive graph that we conjecture is not quasi-isometric to any Cayley graph. No such graph is currently known. Our graph arises both as an abstract limit in a suitable space of graphs and in a concrete way as a subset of a product of trees.
Cayley graph transitive quasi-isometry infinite References
L. Babai, “Vertex-transitive graphs and vertex-transitive maps,”
J. Graph Theory
15 (1991), 587–627.
M. Gromov, “Asymptotic invariants of infinite groups,” in
Geometric Group Theory, Vol. 2, G.A. Niblo and M.A. Roller (Eds.), Cambridge University Press, Cambridge, 1993.
W. Magnus, A. Karrass, and D. Solitar,
Combinatorial Group Theory, Dover, New York, 1976.
P.M. Soardi and W. Woess, “Amenability, unimodularity, and the spectral radius of random walks on infinite graphs,”
205 (1990), 471–486.
C. Thomassen and M.E. Watkins, “Infinite vertex-transitive, edge-transitive, non-1-transitive graphs,”
Proc. Amer. Math. Soc.
105 (1989), 258–261.
V.I. Trofimov, “Graphs with polynomial growth,”
Math. USSR-Sb. 51 (1985), 405–417.
W. Woess, “Topological groups and infinite graphs,”
94 (1991), 1–12. Copyright information
© Kluwer Academic Publishers 2001