Embeddability of finite distance graphs with a large chromatic number in random graphs (Q960646): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:08, 30 January 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
5 January 2009
0 references
Nelson-Erdoes-Hadwiger problem
0 references
chromatic number of Euclidean space
0 references
complete distance graph
0 references
