paper

Connected sums of -knotted triangulations

arXiv:1703.07097

Abstract

An embedded graph is called -knotted if it contains the unique zigzag (up to reversing). We consider -knotted triangulations, i.e. -knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of two -knotted triangulations is -knotted.

Dedicated to the memory of Michel Marie Deza

References in corpus (1)