Timeline for Drawing planar graphs with integer edge lengths
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2012 at 6:39 | comment | added | Tony Huynh | There is still hope for a different method to prove Conjecture 2, but this is probably going to be the best answer that I am likely to receive, so I accepted it. Much thanks. | |
| Mar 9, 2012 at 5:08 | vote | accept | Tony Huynh | ||
| Mar 7, 2012 at 19:06 | comment | added | Tony Huynh | Nice! Unfortunately, this shows that Conjecture 3 is probably false (since Conjecture 4 is probably false), so this line of attack for proving Conjecture 1 is likely to fail. | |
| Mar 7, 2012 at 18:12 | comment | added | Ramiro de la Vega | Actually, you may take $a_n=n$ and this still works. | |
| Mar 7, 2012 at 17:50 | history | edited | Holowitz | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Mar 7, 2012 at 17:43 | history | edited | Holowitz | CC BY-SA 3.0 |
added 22 characters in body; added 21 characters in body; deleted 10 characters in body; added 11 characters in body
|
| Mar 7, 2012 at 17:36 | history | answered | Holowitz | CC BY-SA 3.0 |