The 106-color obstruction conjecture for partial 6-factorizations

A partial $6$-factorization is a collection of edge-disjoint $6$-factors, called colors, in a sub-hypergraph of the complete $3$-uniform hypergraph $K_{10}^3$; an extension is a $6$-factorization of $K_{38}^3$ containing it. The 106-color obstruction conjecture. There exists a partial $6$-factorization of some sub-hypergraph of $K_{10}^3$ using 106 colors that cannot be extended to a $6$-factorization of $K_{38}^3$. This conjecture asserts that the number-of-colors bound achieved by the paper's construction is best possible; the supplied text gives no resolution.