The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) (Q1884650)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
scientific article

    Statements

    The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) (English)
    0 references
    5 November 2004
    0 references
    Erdős and Sos conjectured in 1963 that every graph \(G\) with \(n\) vertices and \(e(G)\) edges contains every tree \(T\) with \(k\) edges, if \(e(G)> \frac 12 n(k-1)\). In this paper the authors prove the conjecture for graphs whose complements contain no cycles of length 4.
    0 references
    0 references
    graph
    0 references
    tree
    0 references
    packing
    0 references
    0 references
    0 references
    0 references
    0 references