1 problem

Let $G$ be a $d$-regular bipartite graph on $v(G)$ vertices, and let $m_k(G)$ denote the number of matchings of size $k$. Set $p=2k/v(G)$, and let $\mathbb{G}_d(p)$ denote the stat…