Number of 1-Factorizations of Regular High-Degree Graphs

A 1-factor in an n -vertex graph G is a collection of $$\frac{n}{2}$$ vertex-disjoint edges and a 1-factorization of G is a partition of its edges into edge-disjoint 1-factors. Clearly, a 1-factorization of G cannot exist unless n is even and G is regular (that is, all vertices are of the same degree). The problem of finding 1-factorizations in graphs goes back to a paper of Kirkman in 1847 and has been extensively studied since then. Deciding whether a graph has a 1-factorization is usually a very difficult question. For example, it took more than 60 years and an impressive tour de force of Csaba, Kühn, Lo, Osthus and Treglown to prove an old conjecture of Dirac from the 1950s, which says that every d -regular graph on n vertices contains a 1-factorization, provided that n is even and $$d \geqslant 2\left[ {\frac{n}{4}} \right] - 1$$ . In this paper we address the natural question of estimating F ( n , d ), the number of 1-factorizations in d -regular graphs on an even number of vertices, provided that $$d \geqslant \left[ {\frac{n}{2}} \right] + \varepsilon n$$ . Improving upon a recent result of Ferber and Jain, which itself improved upon a result of Cameron from the 1970s, we show that $$F\left( {n,\,d} \right) \geqslant {\left( {\left( {1 + o\left( 1 \right)} \right)\frac{d}{{{e^2}}}} \right)^{nd/2}}$$ , which is asymptotically best possible.