Abstract
Given a finite simplicial graph with a vertex-labeling 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.Communicated by Alexander Olshanskii
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
