Equivalence of lower bounds on the number of perfect pairs

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(K_{n}) \geq n*phi(n)/2 and for m and n which are odd and co-prime to each other, c(K_{mn}) \geq 2*c(K_{m})*c(K_{n}). In this note, we establish that both these results are equivalent in the sense that they both give rise to the same lower bound.

[1]  Noga Alon,et al.  Acyclic edge colorings of graphs , 2001, J. Graph Theory.

[2]  Jehoshua Bruck,et al.  Shortening Array Codes and the Perfect $1$-Factorization Conjecture , 2006, IEEE Transactions on Information Theory.

[3]  Patric R. J. Östergård,et al.  One-Factorizations of Regular Graphs of Order 12 , 2005, Electron. J. Comb..

[4]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[5]  Gisaku Nakamura,et al.  A perfect one-factorization ofK36 , 1989, Graphs Comb..

[6]  Douglas R. Stinson,et al.  A perfect one-factorization for K36 , 1988, Discret. Math..

[7]  Richard Královic,et al.  On Semi-perfect 1-Factorizations , 2005, SIROCCO.

[8]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[9]  Ian M. Wanless,et al.  New families of atomic Latin squares and perfect 1-factorisations , 2006, J. Comb. Theory A.

[10]  B. A. Anderson.  Symmetry groups of some perfect 1-factorizations of complete graphs , 1977, Discret. Math..

[11]  J. Dinitz,et al.  There are 23 nonisomorphic perfect one-factorizations ofK14 , 1996 .

[12]  B. A. Anderson.  Finite topologies and Hamiltonian paths , 1973 .

[13]  Douglas R. Stinson,et al.  Some new perfect one-factorizations from starters in finite fields , 1989, J. Graph Theory.

[14]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[15]  Alexander Rosa,et al.  One-factorizations of the complete graph - A survey , 1985, J. Graph Theory.

[16]  David A. Pike.  Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree , 1995, Australas. J Comb..

[17]  Mariusz Meszka.  k-Cycle Free One-Factorizations of Complete Graphs , 2009, Electron. J. Comb..

[18]  Jehoshua Bruck,et al.  Low density MDS codes and factors of complete graphs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[19]  Jehoshua Bruck,et al.  Shortening Array Codes and the Perfect 1-Factorization Conjecture , 2006, ISIT.

[20]  Claude Berge.  Theory of graphs and its applications , 1962 .

[21]  David G. Wagner.  On the perfect one - factorization conjecture , 1992, Discret. Math..

[22]  Peter Dukes,et al.  On the structure of uniform one-factorizations from starters in finite fields , 2006, Finite Fields Their Appl..

[23]  Adam J. Wolfe.  A perfect one‐factorization of K52 , 2009 .