Abstract :
If a graph G is decomposed into m 2-factors, then an orthogonal matching is a matching M in G which contains exactly one edge from each 2-factor. It has been conjectured that any 2-factorization of any graph has an orthogonal matching. We prove this conjecture under the additional assumption that G has at least 3m−2 vertices.
