| Some edge-colored cube decompositions |
In [1], we find necessary and sufficient conditions on n, \mu and G for the existence of a (K_n,Q_3,G,\mu) edge-colored graph decomposition. The constructions rely on the existence of certain decompositions. In this research report we present the necessary decompositions, which were found computationally.
This is joint work by Peter Adams and Darryn Bryant (The University of Queensland) and Heather Gavlas (Illinois State University).
[1] Peter Adams, Darryn E. Bryant and Heather Gavlas, Edge-Colored Cube Decompositions, (submitted).
Here is a copy of the research report, in pdf format.