Embeddability of finite distance graphs with a large chromatic number in random graphs (Q960646)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Embeddability of finite distance graphs with a large chromatic number in random graphs |
scientific article; zbMATH DE number 5485358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embeddability of finite distance graphs with a large chromatic number in random graphs |
scientific article; zbMATH DE number 5485358 |
Statements
Embeddability of finite distance graphs with a large chromatic number in random graphs (English)
0 references
5 January 2009
0 references
Nelson-Erdoes-Hadwiger problem
0 references
chromatic number of Euclidean space
0 references
complete distance graph
0 references
