Semi-duality and the cycle double cover conjecture (Q1085163): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(86)90054-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083487412 / rank | |||
Normal rank |
Revision as of 20:00, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-duality and the cycle double cover conjecture |
scientific article |
Statements
Semi-duality and the cycle double cover conjecture (English)
0 references
1986
0 references
In what follows, all matroids are binary. A cycle is a disjoint union of circuits. Two matroids are called semi-dual if every cocycle of one of them is a cycle of the other. A cycle double cover (CDC) of a matroid is a family of not necessarily distinct cycles, containing every element of the underlying set exactly twice. The CDC-conjecture (that every bridgeless graph has a CDC) is shown to be equivalent to the statement: Every bridgeless regular matroid has a loopless graphic semi-dual. As an application, the author shows that every bridgeless multigraph containing a Hamiltonian path has a CDC consisting of at most 6 Eulerian subgraphs.
0 references
binary matroids
0 references
cycle double cover
0 references
CDC
0 references
bridgeless graph
0 references
bridgeless regular matroid
0 references
Hamiltonian path
0 references