Abstract
Given a finite simplicial graph with a vertex-labelling , the graph product is the free product of the vertex groups with added relations that imply elements of adjacent vertex groups commute. For a quasi-isometric invariant , we are interested in understanding under which combinatorial conditions on the graph the graph product has property . In this article our emphasis is on number of ends of a graph product . In particular, we obtain a complete characterization of number of ends of a graph product of finitely generated groups.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.