加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本