Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
DOI10.1016/j.dam.2018.08.012zbMath1464.05188arXiv1710.05156OpenAlexW2962688658MaRDI QIDQ2026333
Cédric Boutillier, Afshin Behmaram
Publication date: 19 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05156
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) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Coincidence probabilities
- Finding more perfect matchings in leapfrog fullerenes
- Fullerene graphs have exponentially many perfect matchings
- Leapfrog fullerenes have many perfect matchings
- On cyclic edge-connectivity of fullerenes
- On the validations of the asymptotic matching conjectures
- Binomial determinants, paths, and hook length formulae
- Walks, walls, wetting, and melting
- Local statistics of lattice dimers
- The Laplacian and Dirac operators on critical planar graphs
- Random walk in an alcove of an affine Weyl group, and non-colliding random walks on an interval
- Upper bounds for perfect matchings in Pfaffian and planar graphs
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Asymptotics for random walks in alcoves of affine Weyl groups
- Matchings in m-generalized fullerene graphs
- Mathematical aspects of fullerenes
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
This page was built for publication: Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
