Almost all graphs with average degree 4 are 3-colorable (Q5917586)
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 2116464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all graphs with average degree 4 are 3-colorable |
scientific article; zbMATH DE number 2116464 |
Statements
Almost all graphs with average degree 4 are 3-colorable (English)
0 references
18 November 2004
0 references
Random graphs
0 references
Regular random graphs
0 references
Graph coloring
0 references
Threshold phenomena
0 references
0 references
0.8459645509719849
0 references
0.8248294591903687
0 references
0.8224921822547913
0 references
0.822415828704834
0 references
0.8160675764083862
0 references
