Abstract
A graph Γ labeled by a set S defines a group G(Γ) whose set of generators is the set S of labels and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of an aspherical graph and prove that such a graph defines an aspherical group presentation. This result generalizes a theorem of Dominik Gruber on graphs satisfying the graphical C(6)-condition and makes it possible to obtain new graphical conditions of asphericity similar to some classical conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. M. Chiswell, D. J. Collins, and J. Huebschmann, “Aspherical group presentations,” Math. Z. 178 (1), 1–36 (1981).
M. Gromov, “Random walk in random groups,” Geom. Funct. Anal. 13 (1), 73–146 (2003).
Y. Ollivier, “On a small cancellation theorem of Gromov,” Bull. Belg. Math. Soc. Simon Stevin 13 (1), 75–89 (2006).
D. Gruber, “Groups with graphical C(6) and C(7) small cancellation presentations,” Trans. Amer. Math. Soc. 367 (3), 2051–2078 (2015).
A. A. Klyachko, “A funny property of a sphere and equations over groups,” Comm. Algebra 21 (7), 2555–2575 (1993).
D. J. Collins and J. Huebschmann, “Spherical diagrams and identities among relations,” Math. Ann. 261 (2), 155–183 (1982).
R. Lyndon and P. Schupp, Combinatorial Group Theory (Springer, Berlin, 1977; Mir, Moscow, 1980).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bereznyuk, V.Y. Asphericity of Groups Defined by Graphs. Math Notes 105, 316–328 (2019). https://doi.org/10.1134/S0001434619030027
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434619030027