Why almost all \(k\)-colorable graphs are easy to color (Q968270)
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 5703833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why almost all \(k\)-colorable graphs are easy to color |
scientific article; zbMATH DE number 5703833 |
Statements
Why almost all \(k\)-colorable graphs are easy to color (English)
0 references
5 May 2010
0 references
average case analysis
0 references
\(k\)-colorability
0 references
random graphs
0 references
spectral analysis
0 references
0.990616738796234
0 references
0.8761416077613831
0 references
0.8758405447006226
0 references
0.8705433011054993
0 references
0.8502834439277649
0 references
