Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Near-perfect clique-factors in sparse pseudorandom graphs
scientific article

    Statements

    Near-perfect clique-factors in sparse pseudorandom graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2018
    0 references
    clique-factors
    0 references
    \((n,d, \lambda)\)-graphs
    0 references
    pseudorandomness
    0 references

    Identifiers