A quantitative approach to perfect one-factorizations of complete bipartite graphs

作者：Astromujoff Natacha^*; Matamala Martin

来源：Electronic Journal of Combinatorics, 2015, 22(1): P1.72.

Given a one-factorization F of the complete bipartite graph K-n,K-n, let pf(F) denote the number of Hamiltonian cycles obtained by taking pairwise unions of perfect matchings in F. Let pf(n) be the maximum of pf(F) over all one-factorizations F of K-n,K-n. In this work we prove that pf(n)>= n(2)/4, for all n >= 2

• 出版日期2015-3-23