搜索结果: 1-1 共查到“Exponentially many perfect matchings”相关记录1条 . 查询时间(0.062 秒)
Exponentially many perfect matchings in cubic graphs
Exponentially many perfect matchings cubic graphs
2011/1/21
We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings.
This confirms an old conjecture of Lov´asz and Plummer.