Perfect matchings in claw-free cubic graphs (Q540046)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5902992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matchings in claw-free cubic graphs |
scientific article; zbMATH DE number 5902992 |
Statements
Perfect matchings in claw-free cubic graphs (English)
0 references
1 June 2011
0 references
Summary: Lovász and Plummer conjectured that there exists a fixed positive constant \(c\) such that every cubic \(n\)-vertex graph with no cutedge has at least \(2^{cn}\) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour. We prove that every claw-free cubic \(n\)-vertex graph with no cutedge has more than \(2^{n/12}\) perfect matchings, thus verifying the conjecture for claw-free graphs.
0 references
perfect matching
0 references
claw free graph
0 references
cubic graph
0 references
0.9054353833198548
0 references
0.885539710521698
0 references
0.8698275685310364
0 references
0.8547171950340271
0 references
0.8539143800735474
0 references
