Overfull Sets of One-Factors

We define an overfull set of one-factors of \( K_{2n} \) to be a set of one-factors that between them cover all the edges of \( K_{2n} \), but contain no one-factorization of \( K_{2n} \). We address the question: how many members can such a set contain?