Timeline for How many edges can be added to two circles before the graph becomes Hamiltonian?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2017 at 14:36 | history | edited | Wolfgang | CC BY-SA 3.0 |
updated broken links
|
| Jul 7, 2016 at 11:36 | vote | accept | Wolfgang | ||
| Jul 6, 2016 at 10:12 | comment | added | Wolfgang | @GerhardPaseman Yes that should work, so it guarantees $f(n)\ge n-1$ for even $n\ge10$. | |
| Jul 6, 2016 at 7:51 | comment | added | Gerhard Paseman | You should be able to add an extra vertex (split an edge) to each cycle without creating a Hamilton cycle. If so, then the maximum number becomes at least n-1 for n > 8. Gerhard "Or Does That Not Work?" Paseman, 2016.07.06. | |
| Jul 6, 2016 at 2:28 | history | answered | Brendan McKay | CC BY-SA 3.0 |