Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Paths in graphs, reducing the edge-connectivity only by two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths and edge-connectivity in graphs / rank | |||
Normal rank | |||
Revision as of 15:10, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs |
scientific article |
Statements
Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (English)
0 references
16 January 1993
0 references
Providing counterexamples to a conjecture of Mader, the following theorem is proven: If \(n\geq 3\) is odd, then there exists an \(n\)-edge-connected graph \(G\) of order \(2^{(n+3)/2}\) which contains two vertices \(u\) and \(v\) at distance three such that, for each cycle \(C\) passing through \(u\) and \(v\), \(G-E(C)\) is not \((n-2)\)-edge-connected.
0 references
\(n\)-edge-connected graph
0 references
counterexamples
0 references
conjecture of Mader
0 references
cycle
0 references
