A weaker version of Lovász' path removal conjecture (Q947724)

From MaRDI portal
Revision as of 02:04, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A weaker version of Lovász' path removal conjecture
scientific article

    Statements

    A weaker version of Lovász' path removal conjecture (English)
    0 references
    0 references
    0 references
    0 references
    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 references

    Identifiers