Perfect matchings in claw-free cubic graphs (Q540046): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0906.2261 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:09, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in claw-free cubic graphs |
scientific article |
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
