Timeline for Decompose complete directed graph with n vertices into n edge-disjoint cycles with length n−1
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2023 at 21:28 | history | edited | LSpice | CC BY-SA 4.0 |
Name of "this paper"
|
| May 7, 2023 at 19:43 | answer | added | Claude Chaunier | timeline score: 0 | |
| Apr 30, 2023 at 23:38 | comment | added | Claude Chaunier | I found none for $n=6$ by computer exhaustive search, and some for $n=3,4,5,7,8,9,10,11$. Furthermore, all solutions show @GerryMyerson 's symmetry for $n=3,4,5,7$. There always are some showing the symmetry for $n=8,9,10,11$. And some not showing it for $n=8,9$ (I haven't looked for them yet for $n=10$ or $11$). | |
| Apr 23, 2023 at 1:02 | answer | added | Gerry Myerson | timeline score: 2 | |
| Apr 22, 2023 at 23:08 | comment | added | Gerry Myerson | I wonder whether an even stronger result might be true, that one can always arrange for the matrix, leaving out the bottom row, to be symmetric. | |
| Apr 22, 2023 at 15:43 | comment | added | chunma | @GerryMyerson Thanks. I have this. But cannot come up one with n=6. And I am wondering whether it is possible to prove or disprove it is always possible for general n. | |
| Apr 22, 2023 at 4:58 | comment | added | Gerry Myerson | In case you don't already have it, here's $n=5$: $$\matrix{1&2&3&4\cr2&4&5&3\cr3&5&2&1\cr4&3&1&5\cr5&1&4&2\cr}$$ | |
| S Apr 21, 2023 at 4:21 | review | First questions | |||
| Apr 21, 2023 at 4:51 | |||||
| S Apr 21, 2023 at 4:21 | history | asked | chunma | CC BY-SA 4.0 |