Timeline for Labelled spanning trees without edge crossings
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2010 at 20:51 | comment | added | Konrad Swanepoel | I've now deleted my own incorrect attempt at a proof. | |
| Dec 13, 2010 at 20:51 | history | edited | Konrad Swanepoel | CC BY-SA 2.5 |
Removed incorrect attempt at a proof.
|
| Dec 13, 2010 at 0:19 | comment | added | Dr Shello | Awesome. For the historians, that paper mentions this problem is originally due to Bialostocki and Dierker. I learned about this problem from a friend of mine many years ago who was doing his PhD on cage graphs, was re-reading our notes from when I visited him and found it with a few (failed) attempts at proof (hence the MO post). I'd forgotten about it and I guess he never solved it... | |
| Dec 12, 2010 at 22:53 | history | edited | Konrad Swanepoel | CC BY-SA 2.5 |
added 481 characters in body
|
| Dec 12, 2010 at 22:46 | comment | added | Konrad Swanepoel | I don't see how to fix this easily, so instead I'll add a reference to the literature.... | |
| Dec 12, 2010 at 21:08 | comment | added | Fedor Petrov | G-x is not triangulation... | |
| Dec 12, 2010 at 21:03 | history | answered | Konrad Swanepoel | CC BY-SA 2.5 |