Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
123 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
51 tokens/sec
2000 character limit reached

On Legendrian Graphs (1108.2281v1)

Published 10 Aug 2011 in math.GT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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