Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers (Q5412823): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1070/im2014v078n01abeh002680 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2322848408 / rank | |||
Normal rank | |||
Revision as of 09:57, 30 July 2024
scientific article; zbMATH DE number 6289473
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers |
scientific article; zbMATH DE number 6289473 |
Statements
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers (English)
0 references
28 April 2014
0 references
distance graph
0 references
chromatic number
0 references
clique number
0 references
Nelson problem
0 references
