Timeline for Hamilton cycle decompositions of the complete graph
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 3, 2010 at 23:14 | history | edited | Harrison Brown | CC BY-SA 2.5 |
added 198 characters in body
|
| Jan 3, 2010 at 23:11 | comment | added | Harrison Brown | Hm, good point about the simplification, I got confused. I'll fix that. Yeah, it's pretty memory intensive, but I suspect it'll be quick enough to calculate a few examples with n > 5. | |
| Jan 3, 2010 at 22:52 | comment | added | Douglas S. Stones | I think I get the idea... this would be a fairly memory intensive algorithm. But I should be able to implement it in GAP (I don't have Combinatorica). Also, I'm not sure if you can make the simplification $k \leq (n-1)/2$, for example how would it handle Hamilton cycles like (1723456) when n=7? | |
| Jan 3, 2010 at 20:34 | history | answered | Harrison Brown | CC BY-SA 2.5 |