On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments (Q4584909)
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: On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments |
scientific article; zbMATH DE number 6932058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments |
scientific article; zbMATH DE number 6932058 |
Statements
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments (English)
0 references
5 September 2018
0 references
chromatic number
0 references
graph coloring
0 references
MAX-cut
0 references
random graph
0 references
random tournament
0 references
0.7548685669898987
0 references
0.7546702027320862
0 references
0.7516986131668091
0 references
0.7509444355964661
0 references
