Perfect matchings in claw-free cubic graphs (Q540046): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5902992 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
perfect matching | |||
| Property / zbMATH Keywords: perfect matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
claw free graph | |||
| Property / zbMATH Keywords: claw free graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cubic graph | |||
| Property / zbMATH Keywords: cubic graph / rank | |||
Normal rank | |||
Revision as of 09:59, 1 July 2023
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
