\(3n-5\) edges do force a subdivision of \(K_5\) (Q1307446)

From MaRDI portal
scientific article
Language Label Description Also known as
English
\(3n-5\) edges do force a subdivision of \(K_5\)
scientific article

    Statements

    \(3n-5\) edges do force a subdivision of \(K_5\) (English)
    0 references
    0 references
    31 October 1999
    0 references
    It is shown that a graph on at least 3 vertices and with \(3n-5\) edges contains a subdivision of \(K_5\). This was conjectured by Dirac in 1964. The proof is fairly involved.
    0 references
    extremal graph theory
    0 references

    Identifiers