On one-factorizations of the complete graph
Every one-factorization of the complete graph on n vertices contains k one-factors whose union is connected and \(k\leq^ 2\log n\). This was conjectured by L. Babai and P. Erdős.
scientific article; zbMATH DE number 4004223