On the intersection problem for 1-factorizations and near 1-factorizations of Kυ
Abstract
The number of 1-factors (near 1-factors) that μ 1-factorizations (near 1-factorizations) of the complete graph Kυ, υ even (υ odd), can have in common, is studied. The problem is completely settled for μ = 2 and μ = 3.











