The Library
Exponentially many perfect matchings in cubic graphs
Tools
Esperet, Louis, Kardoš, František, King, Andrew D., Králʼ, Daniel and Norine, Serguei (2011) Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, Vol.227 (No.4). pp. 1646-1664. doi:10.1016/j.aim.2011.03.015 ISSN 0001-8708.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.aim.2011.03.015
Abstract
We show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect matchings. This confirms an old conjecture of Lovász and Plummer
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Advances in Mathematics | ||||
Publisher: | Academic Press | ||||
ISSN: | 0001-8708 | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol.227 | ||||
Number: | No.4 | ||||
Page Range: | pp. 1646-1664 | ||||
DOI: | 10.1016/j.aim.2011.03.015 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |