Factor domination and minimum degree (Q1868841)

As their main result the authors prove the best-possible estimate \(\gamma(F_1,F_2)\leq \frac{2}{3}n\) where \(F_1\) and \(F_2\) are factors of the complete graph \(K_n\) of order \(n\) that have minimum degree at least \(1\). The proof idea also yields an upper bound of the factor domination number of \(k\geq 2\) factors of \(K_n\) of minimum degree \(1\). The second main result is an upper bound on \(\gamma(F_1,F_2,\dots ,F_k)\) in terms of the least minimum degree \(\delta\) of the factors, their number \(k\) and their order \(n\) that is proved using a well-known probabilistic argument.