Rigidity of graph products of groups.
Radcliffe, David G. (2003)
Algebraic & Geometric Topology
Similarity:
Radcliffe, David G. (2003)
Algebraic & Geometric Topology
Similarity:
Bruno Zimmermann (1998)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Crisp, John, Wiest, Bert (2004)
Algebraic & Geometric Topology
Similarity:
Matthew Dyer (1991)
Compositio Mathematica
Similarity:
Diao, Guo-An, Feighn, Mark (2005)
Geometry & Topology
Similarity:
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Firat Ates, A. Sinan Çevik (2009)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Ryszard Szwarc (2003)
Colloquium Mathematicae
Similarity:
Let (W,S) be a Coxeter system such that no two generators in S commute. Assume that the Cayley graph of (W,S) does not contain adjacent hexagons. Then for any two vertices x and y in the Cayley graph of W and any number k ≤ d = dist(x,y) there are at most two vertices z such that dist(x,z) = k and dist(z,y) = d - k. Allowing adjacent hexagons, but assuming that no three hexagons can be adjacent to each other, we show that the number of such intermediate vertices at a given distance from...
Bohdan Zelinka (1981)
Czechoslovak Mathematical Journal
Similarity: