Timeline for Is a knotted trivalent graph determined by its set of unzips?
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 10, 2017 at 9:42 | history | edited | CommunityBot |
replaced http://1.bp.blogspot.com/ with https://1.bp.blogspot.com/
|
|
Feb 24, 2013 at 23:25 | vote | accept | Daniel Moskovich | ||
Feb 23, 2013 at 16:34 | answer | added | Ian Agol | timeline score: 6 | |
Feb 21, 2013 at 21:31 | answer | added | Ian Agol | timeline score: 3 | |
Feb 19, 2013 at 17:53 | answer | added | Scott Taylor | timeline score: 7 | |
Feb 15, 2013 at 10:48 | comment | added | Neil Hoffman | If you wanted to investigate possible counterexamples, you could distinguish theta graphs up to ambient isotopy via the methods of Heard, Hodgson, Martelli, and Petronio (arxiv.org/abs/0804.4790), that is you could label each graph with appropriate integers (at a vertex with edges labeled by (a,b,c), 1/a+1/b+1/c>1) and associate a compact orbifold without boundardy to each embedding. Actually, you should associate 6 orbifolds to each embedding one for every permutation of (a,b,c). To create your own examples, you could use the software (ms.unimelb.edu.au/~snap/orb.html). | |
Feb 14, 2013 at 9:34 | history | asked | Daniel Moskovich | CC BY-SA 3.0 |