Matchings in Benjamini–Schramm convergent graph sequences

DOI10.1090/tran/6464zbMath1331.05176arXiv1405.3271MaRDI QIDQ2790620

Gábor Kun, Miklós Abért, Péter E. Frenkel, Péter Csikvári

Publication date: 7 March 2016

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.3271

zbMATH Keywords

matchings; matching polynomial; expander graphs; Benjamini-Schramm convergence

Mathematics Subject Classification ID

05C31: Graph polynomials

05C80: Random graphs (graph-theoretic aspects)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Convergence of graphs with intermediate density, Matchings in vertex-transitive bipartite graphs, Chromatic roots and limits of dense graphs, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems

Cites Work

• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• The roots of the independence polynomial of a clawfree graph
• Addendum to Schrijver's work on minimum permanents
• Benjamini-Schramm continuity of root moments of graph polynomials
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• On the number of matchings in regular graphs
• Spanning trees in regular graphs
• The number of matchings in random regular graphs and bipartite graphs
• The expected eigenvalue distribution of a large regular graph
• Counting 1-factors in regular bipartite graphs
• Recurrence of distributional limits of finite planar graphs
• A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
• Theory of monomer-dimer systems
• On Leonid Gurvits’s Proof for Permanents
• Borel oracles. An analytical approach to constant-time algorithms
• The Independence Ratio of Regular Graphs
• Asymptotic Enumeration of Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item