Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.