Almost all graphs with 1.44n edges are 3-colorable (Q3201078)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3201078 |
scientific article; zbMATH DE number 4177088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all graphs with 1.44n edges are 3-colorable |
scientific article; zbMATH DE number 4177088 |
Statements
Almost all graphs with 1.44n edges are 3-colorable (English)
0 references
1991
0 references
uniform asymptotic approximation
0 references
3-colorable
0 references
0.890213131904602
0 references
0.8224921822547913
0 references
0.799843966960907
0 references
0.7910552024841309
0 references
