The Thurston–Bennequin number conjecture for unknotted minimal embeddings of
The Thurston–Bennequin number conjecture for unknotted minimal embeddings of
Let be the complete graph on five vertices, and consider an unknotted minimal embedding of as a Legendrian graph. For each -cycle in the embedding, let denote its Thurston–Bennequin number. Thurston–Bennequin number conjecture. Any unknotted minimal embedding of will contain at least one -cycle with , and will not contain a -cycle with .
Sources & referencesView supporting material
Primary source
Danielle O'Donnol and Elena Pavelescu, “The total Thurston-Bennequin number of complete and complete bipartite Legendrian graphs”, arXiv:1507.07065 (2015).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.