Tight asymptotics of clique-chromatic numbers of dense random graphs

Yu Demidovich*, M. Zhukovskii

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Tight asymptotics of clique-chromatic numbers of dense random graphs'. Together they form a unique fingerprint.

Mathematics

Keyphrases