combinatorics / Graph decompositions
For $D_3(m) = \vec{C}_m \square \vec{C}_m \square \vec{C}_m$, can the full arc set be partitioned into three directed Hamilton cycles for every integer $m \ge 3$?
Temporal state
No reconciled state yet.
Append-only history
For $D_3(m) = \vec{C}_m \square \vec{C}_m \square \vec{C}_m$, can the full arc set be partitioned into three directed Hamilton cycles for every integer $m \ge 3$?
Research memory
For $D_3(m) = \vec{C}_m \square \vec{C}_m \square \vec{C}_m$, can the full arc set be partitioned into three directed Hamilton cycles for every integer $m \ge 3$?
Evidence graph
No public relationships recorded yet.