Perfect matchings in planar cubic graphs

Author(s): Chudnovsky, Maria; Seymour, Paul D.

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1ht1d

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2018-07-20T15:09:05Z	-
dc.date.available	2018-07-20T15:09:05Z	-
dc.date.issued	2012-04	en_US
dc.identifier.citation	Chudnovsky, Maria, Seymour, Paul. (2012). Perfect matchings in planar cubic graphs. COMBINATORICA, 32 (403 - 424. doi:10.1007/s00493-012-2660-9	en_US
dc.identifier.issn	0209-9683	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1ht1d	-
dc.description.abstract	A well-known conjecture of Lovasz and Plummer from the mid-1970’s, still open, asserts that for every cubic graph G with no cutedge, the number of perfect matchings in G is exponential in \|V (G)\|. In this paper we prove the conjecture for planar graphs; we prove that if G is a planar cubic graph with no cutedge, then G has at least 2(\|V(G)\|/655978752) perfect matchings.	en_US
dc.format.extent	403 - 424	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	COMBINATORICA	en_US
dc.rights	Author's manuscript	en_US
dc.title	Perfect matchings in planar cubic graphs	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1007/s00493-012-2660-9	-
dc.date.eissued	2012-09-02	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
Perfect_matchings.pdf		191.06 kB	Adobe PDF	View/Download