On distance graphs with large chromatic number but without large simplices (Q3521039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5316838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On distance graphs with large chromatic number but without large simplices |
scientific article; zbMATH DE number 5316838 |
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
