On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (Q4256092)
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 1309111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs |
scientific article; zbMATH DE number 1309111 |
Statements
9 January 2000
0 references
nibble method
0 references
chromatic number
0 references
choice number
0 references
polynomial coloring algorithm
0 references
random graphs
0 references
hypergraphs
0 references
locally sparse graphs
0 references
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (English)
0 references
0.8660888671875
0 references
0.8646474480628967
0 references
0.8617770075798035
0 references
0.8509525656700134
0 references
0.8453925251960754
0 references
