Colouring set families without monochromatic \(k\)-chains (Q2326327)

From MaRDI portal
Revision as of 03:51, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Colouring set families without monochromatic \(k\)-chains
scientific article

    Statements

    Colouring set families without monochromatic \(k\)-chains (English)
    0 references
    0 references
    7 October 2019
    0 references
    Erdős-Rothschild problems
    0 references
    Sperner's theorem
    0 references
    \(k\)-chains
    0 references
    \((r, k)\)-colourings
    0 references

    Identifiers