Tight asymptotics of clique‐chromatic numbers of dense random graphs (Q6074590)
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: Tight asymptotics of clique‐chromatic numbers of dense random graphs |
scientific article; zbMATH DE number 7749422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight asymptotics of clique‐chromatic numbers of dense random graphs |
scientific article; zbMATH DE number 7749422 |
Statements
Tight asymptotics of clique‐chromatic numbers of dense random graphs (English)
0 references
12 October 2023
0 references
inclusion maximal clique
0 references
binomial random graphs
0 references
0.91932612657547
0 references
0.8401339650154114
0 references
0.8335908651351929
0 references
0.8097606301307678
0 references
0.8060703277587891
0 references
