New construction of graphs with high chromatic number and small clique number (Q1702354)

From MaRDI portal
Revision as of 05:34, 15 July 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
New construction of graphs with high chromatic number and small clique number
scientific article

    Statements

    New construction of graphs with high chromatic number and small clique number (English)
    0 references
    28 February 2018
    0 references
    Borsuk-Ulam theorem
    0 references
    chromatic number
    0 references
    Tucker's lemma
    0 references
    triangle-free graphs
    0 references

    Identifiers