Equivalence of lower bounds on the number of perfect pairs

V. Ch. Venkaiah, K. Ramanjaneyulu, Neelima Jampala +1

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…