New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bound for the chromatic number of a random subgraph of a distance graph |
scientific article |
Statements
New upper bound for the chromatic number of a random subgraph of a distance graph (English)
0 references
3 July 2015
0 references
Hadwiger-Nelson problem
0 references
distance graph
0 references
random subgraph
0 references
chromatic number
0 references
Turán number
0 references
