On a small cancellation theorem of Gromov

By Yann Ollivier. 2003

61 citations recorded by the source corpus.

We give a combinatorial proof of a theorem of Gromov, which extends the scope of small cancellation theory to group presentations arising from labelled graphs.

View Paper: https://www.semanticscholar.org/paper/d17320a05cd74988019bed0558b814c310cc5f16

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Alessandro Sisto
2. Dominik Gruber
3. Daniel T. Wise
4. Mark F. Hagen
5. Jason A. Behrstock
6. Frédéric Haglund
7. Anthony Genevois
8. Denis V. Osin

Citations in the corpus

• Infinitely presented graphical small cancellation groups are acylindrically hyperbolic (2014, background): “Ollivier [Oll06] and, subsequently, the first author [Gru15a] proved that combinatorial interpretations of Gromov’s graphical small cancellation theory provide more elementary tools for producing new examples of Gromov’s monsters.”
• RESEARCH ANNOUNCEMENT: THE STRUCTURE OF GROUPS WITH A QUASICONVEX HIERARCHY (2009, background): “Some further work along these lines is: Cubulation of Coxeter groups [34], of certain small-cancellation groups [49], of Gromov’s random groups at density 16 [37], and of rhombus groups related to Penrose tilings [29].”