Timeline for Can we find 3 disjoint directed Hamiltonian cycles in the cube?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jun 5, 2015 at 3:03 | comment | added | Gordon Royle | @Ben - thanks, I was confusing myself about the actual problem. | |
| Jun 4, 2015 at 11:32 | comment | added | Ben Barber | @GordonRoyle, double each cycle and orient them in opposite directions. | |
| Jun 4, 2015 at 8:11 | comment | added | Gordon Royle | Why does the $d$-cube having a Hamilton decomposition answer the question for all even $d$? I thought the original question required the cycles to use each directed edge once, which would mean assigning a direction to each of the cycles in the decomposition in such a way that each edge is traversed exactly once in each direction? | |
| Jun 3, 2015 at 23:24 | comment | added | j.c. | Hmm, maybe some progress with $d$ odd can be made using the result mentioned in this question? mathoverflow.net/questions/5340 . I guess this is the reference: kam.mff.cuni.cz/~fink/publications/kreweras1.pdf | |
| Jun 3, 2015 at 23:07 | history | answered | j.c. | CC BY-SA 3.0 |