Timeline for Is every knot unavoidable in the embeddings of some graph?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2014 at 23:30 | vote | accept | Joseph O'Rourke | ||
| Jul 15, 2014 at 13:32 | answer | added | John Pardon | timeline score: 7 | |
| Jul 15, 2014 at 13:20 | comment | added | John Pardon | Trivial observation: since every graph is a subgraph of a complete graph, it suffices to consider complete graphs for the purposes of this question. | |
| Jul 15, 2014 at 13:07 | answer | added | Tony Huynh | timeline score: 12 | |
| Jul 15, 2014 at 12:38 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |