On the density of subgraphs in a graph with bounded independence number (Q1272486)

From MaRDI portal
Revision as of 16:43, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the density of subgraphs in a graph with bounded independence number
scientific article

    Statements

    On the density of subgraphs in a graph with bounded independence number (English)
    0 references
    0 references
    3 January 1999
    0 references
    The maximum density of the \(k\)-subgraphs of any \(n\)-graph with independence number at most \(m\) is determined up to a multiplicative constant for all \(n,m,k\).
    0 references
    density
    0 references
    independence number
    0 references

    Identifiers