2000 character limit reached
Connected sums of $Z$-knotted triangulations
Published 21 Mar 2017 in math.CO and math.AT | (1703.07097v2)
Abstract: An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of two $z$-knotted triangulations is $z$-knotted.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.