We define an overfull set of one-factors of K2n to be a set of one-factors that between them cover all the edges of K2n, but contain no one-factorization of K2n. We address the question: how many members can such a set contain?
