2000 character limit reached
Planar Legendrian graphs
Published 4 Apr 2016 in math.GT | (1604.00836v1)
Abstract: We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique trivial embedding of $G$ is Legendrian simple.
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.