Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Legendrian Graphs

Published 10 Aug 2011 in math.GT | (1108.2281v1)

Abstract: We investigate Legendrian graphs in $(\R3, \xi_{std})$. We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian unknots with $tb=-1$ and $rot=0$ if and only if it does not contain $K_4$ as a minor. We show that the pair $(tb, rot)$ does not characterize a Legendrian graph up to Legendrian isotopy if the graph contains a cut edge or a cut vertex. For the lollipop graph the pair $(tb,rot)$ determines two Legendrian classes and for the handcuff graph it determines four Legendrian classes.

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.