Timeline for Number of pairs of edge-disjoint Hamilton cycles in complete graphs
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 11, 2021 at 7:01 | comment | added | Wlod AA | Let $\ n>2\ $ be a prime number. Let the vertices form a regular n-gon. There are $\ a:=\frac{n-1}2\ $ Hamiltonian cycles, one for each length of the edges. Then there are $\ \binom a2\ $ (unordered) pairs of these cycles where the members of the same pair are edge-disjoint. | |
| Jul 11, 2021 at 5:43 | comment | added | bof | Related to A002816, isn't it? Number of Hamiltonian cycles in the complement of the cycle graph $C_n$? | |
| Jul 11, 2021 at 5:26 | comment | added | Sam Hopkins | It should be relatively straightforward to write an inclusion-exclusion expression for this number. | |
| Jul 11, 2021 at 5:12 | history | asked | Manfred Weis | CC BY-SA 4.0 |