Many cliques in \(H\)-free subgraphs of random graphs (Q1630692)

From MaRDI portal
Revision as of 04:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Many cliques in \(H\)-free subgraphs of random graphs
scientific article

    Statements

    Many cliques in \(H\)-free subgraphs of random graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2018
    0 references
    Turán type problems
    0 references
    random graphs
    0 references
    chromatic number
    0 references

    Identifiers