On the expected number of perfect matchings in cubic planar graphs

DOI10.5565/PUBLMAT6612213zbMath1482.05163arXiv2005.13821OpenAlexW4205894310MaRDI QIDQ2075311

Juanjo Rué, Marc Noy, Clément Requilé

Publication date: 14 February 2022

Published in: Publicacions Matemàtiques (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsregular graphsasymptotic enumeration

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16)

Related Items (3)

Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023 ⋮ What is a random surface? ⋮ Unnamed Item

Uses Software

• gfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
• Exponentially many perfect matchings in cubic graphs
• The complexity of computing the permanent
• Counting surfaces. CRM Aisenstadt chair lectures
• The maximum number of perfect matchings in graphs with a given degree sequence
• The number of matchings in random regular graphs and bipartite graphs
• Matching theory
• Counting rooted maps by genus. III: Nonseparable maps
• Enumeration of rooted cubic planar maps
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Planar diagrams
• Universal singular exponents in catalytic variable equations
• Counting colored planar maps: algebraicity results
• The generating function of planar Eulerian orientations
• Perfect matchings in planar cubic graphs
• Graph Theory
• Asymptotic enumeration and limit laws of planar graphs
• A Census of Planar Triangulations
• A Census of Hamiltonian Polygons
• Random cubic planar graphs
• Random Trees
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• GFUN
• Further results on random cubic planar graphs
• Sparse graphs: Metrics and random models
• Enumeration of labelled 4‐regular planar graphs
• On the Enumeration of Tree-Rooted Maps
• A Census of Planar Maps
• On Hamiltonian Circuits

This page was built for publication: On the expected number of perfect matchings in cubic planar graphs