Fetching the paper…
Reading the bibliography…
Friedland's Lower Matching Conjecture asserts that if $G$ is a $d$--regular bipartite graph on $v(G)=2n$ vertices, and $m_k(G)$ denotes the number of matchings of size $k$, then $$m_k(G)\geq {n \choose k}^2\left(\frac{d-p}{d}\right)^{n(d-p)}(dp)^{np},$$ where $p=\frac{k}{n}$.
Zykov, A. A.: On some properties of linear complexes, Mat. Sbornik N.S., 24
1949
Earlier work this paper cites.
Robbins, H.: A remark on Stirling’s formula, American Mathematical Monthly, 66
1955
Earlier work this paper cites.
Darroch, J. N.: On the distribution of the number of successes in independent trials, Ann. Math. Statist. 35
1964
Earlier work this paper cites.
Hoeffding, W.: On the distribution of the number of successes in independent trials, Ann. Math. Stat., 35
1964
Earlier work this paper cites.
Heilmann, O. J., Lieb, E. H.: Theory of monomer-dimer systems, Commun. Math. Physics 25
1972
Earlier work this paper cites.
Voorhoeve, M.: A lower bound for the permanents of certain (0,1)-matrices, Indagationes Mathematicae 41
1979
Earlier work this paper cites.
Schrijver A., Valiant W. G.: On lower bounds for permanents, Indagationes Mathematicae 42
1980
Earlier work this paper cites.
Godsil, C. D., Gutman, I.: On the matching polynomial of a graph, Algebraic Methods in Graph Theory (L. Lovász and V.T. Sós, eds.), Colloquia Mathematica Societatis János Bolyai 25
1981
Earlier work this paper cites.
Bollobás, B., McKay, B. D.: The number of matchings in random regular graphs and bipartite graphs, J. Combinatorial Theory, Series B 41
1986
Earlier work this paper cites.
Godsil, C. D.: Algebraic Combinatorics, Chapman and Hall, New York 1993
1993
Cited alongside, same era.
Pitman, J.: Probabilistic bounds on the coefficients of polynomials with only real zeros, J. Combin. Theory Ser. A, 77
1997
Cited alongside, same era.
Schrijver, A.: Counting 1-factors in regular bipartite graphs, J. Combin. Theory Ser. B 72
1998
Cited alongside, same era.
Bayati, M., Gamarnik, D., Katz, D., Nair, C., Tetali, P.: Simple deterministic algorithm for counting matchings, ACM Symp. on Theory of Computing (STOC, San Diego, 2007, appeared)
2007
Cited alongside, same era.
Friedland, S., Krop, E., Markström, K.: On the Number of Matchings in Regular Graphs, The Electronic Journal of Combinatorics, 15
2008
Cited alongside, same era.
Greenhill, C., Janson, S., Ruciński, A.: On the number of perfect matchings in random lifts, Combin. Probab. Comput. 19
2010
Later among the works it cites.
Laurent, M., Schrijver, A.: On Leonid Gurvits’s proof for permanents, Amer. Math. Monthly 117
2010
Later among the works it cites.
Gutman, I., Wagner, S.: The matching energy of a graph, Discrete Applied Mathematics 160
2012
Later among the works it cites.
Lovász, L.: Large networks and graph limits, American Mathematical Society Colloquium Publications, 60. American Mathematical Society, Providence, RI, 2012
2012
Later among the works it cites.
Abért, M., Csikvári, P., Hubai, T.: Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, J. Stat. Phys. 161
2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gurvits, L.: Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all, Electron. J. Combin. 15
2008
Cited alongside, same era.
Nguyen, H. N., Onak, K.: Constant-time approximation algorithms via local improvements, 49th Annual IEEE Symposium on Foundations of Computer Science, 327–336 (2008)
2008
Cited alongside, same era.
Elek, G., Lippner, G.: Borel oracles. An analytical approach to constant-time algorithms, Proc. Amer. Math. Soc. 138
2010
Cited alongside, same era.
Gurvits, L.: Unleashing the power of Schrijver’s permanental inequality with the help of the Bethe Approximation, ArXiv preprint 1106.2844v11
Cited in the paper.
Lelarge, M.: Counting matchings in irregular bipartite graphs and random lifts, Arxiv preprint 1507.04739
Cited in the paper.
Linial, N.: Lifts of graphs, (talk slides), http://www.cs.huji.ac.il/˜nati/PAPERS/lifts_talk.pdf
Cited in the paper.
Abért, M., Csikvári, P., Frenkel, P. E., Kun, G.: Matchings in Benjamini–Schramm convergent graph sequences, Trans. Amer. Math. Soc. 368
2016
Closest in time.
Csikvári, P., Frenkel, P.E.: Benjamini–Schramm continuity of root moments of graph polynomials, Eur. J. Combin. 52
2016
Closest in time.
Dumitriu, I., Johnson, T.: The Marcenko-Pastur law for sparse random bipartite biregular graphs, Random Structures and Algorithms 48
2016
Closest in time.