On a small cancellation theorem of Gromov
Yann Ollivier
Abstract
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.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng