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

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

    Statements

    Near-perfect clique-factors in sparse pseudorandom graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    linear programming
    0 references
    probabilistic techniques
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references