𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs

✍ Scribed by Louis Esperet; František Kardoš; Daniel Král’

Book ID
113582414
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
482 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
✍ Zhang Fuji; Zhang Heping 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv