Embeddability of finite distance graphs with a large chromatic number in random graphs (Q960646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 15-colouring of 3-space omitting distance one / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:11, 28 June 2024

scientific article
Language Label Description Also known as
English
Embeddability of finite distance graphs with a large chromatic number in random graphs
scientific article

    Statements

    Embeddability of finite distance graphs with a large chromatic number in random graphs (English)
    0 references
    0 references
    5 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Nelson-Erdoes-Hadwiger problem
    0 references
    chromatic number of Euclidean space
    0 references
    complete distance graph
    0 references