On distance graphs with large chromatic number but without large simplices (Q3521039)

From MaRDI portal
Revision as of 09:57, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On distance graphs with large chromatic number but without large simplices
scientific article

    Statements

    On distance graphs with large chromatic number but without large simplices (English)
    0 references
    27 August 2008
    0 references
    Nelson Erdoes Hadwiger problem
    0 references
    combinatorial geometry
    0 references
    chromatic number
    0 references
    distance graph
    0 references

    Identifiers

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