Almost all graphs with 1.44n edges are 3-colorable (Q3201078): Difference between revisions
From MaRDI portal
Removed claim: published in (P200): Item:Q6486797 |
Changed an Item |
||
| Property / published in | |||
| Property / published in: Random Structures \& Algorithms / rank | |||
Normal rank | |||
Latest revision as of 03:17, 29 April 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all graphs with 1.44n edges are 3-colorable |
scientific article |
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
