On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors (Q3588404)
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 5783893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors |
scientific article; zbMATH DE number 5783893 |
Statements
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (English)
0 references
10 September 2010
0 references
hardness of approximation
0 references
graph coloring
0 references
majority is stablest
0 references
0.8562572598457336
0 references
0.8559389114379883
0 references
0.8317863345146179
0 references
0.7956451177597046
0 references
0.7820647358894348
0 references
