Abstract
Given a finite set of graphs (that can be either finite or infinite), we construct polygonal complexes such that the link of each vertex is isomorphic to one of the give graphs. For this purpose, we use, essentially, the theory of complexes of groups (see Corson, 1992; Haefliger, 1991; Stallings, 1991).
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.
