A weaker version of Lovász' path removal conjecture (Q947724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A weaker version of Lovász' path removal conjecture |
scientific article; zbMATH DE number 5349233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A weaker version of Lovász' path removal conjecture |
scientific article; zbMATH DE number 5349233 |
Statements
A weaker version of Lovász' path removal conjecture (English)
0 references
7 October 2008
0 references
The authors prove that there exists a function \(f(k)\) such that for every \(f(k)\)-connected graph \(G\) and for every edge \(e\in E(G)\), there exists an induced cycle \(C\) containing \(e\) such that \(G-E(C)\) is \(k\)-connected. This confirms a weakening of a conjecture of Lovász due to Kriesel.
0 references
connectivity
0 references
removable paths
0 references
non-separating cycles
0 references
0.861542820930481
0 references
0.827657163143158
0 references
0.8213165998458862
0 references
0.8174829483032227
0 references
0.8160847425460815
0 references
