On a small cancellation theorem of Gromov
arXiv:math/0310022
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.
Version 2 corrects a mistake in the proof of the isometric embedding property