On the chromatic number of graphons

M. Isaev, M. Kang

Research output: Working paperPreprint

Abstract

We determine the asymptotic behaviour of the chromatic number of exchangeable random graphs defined by step-regulated graphons. Furthermore, we show that the upper bound holds for a general graphon. We also extend these results to sparse random graphs obtained by percolations on graphons
Original languageEnglish
Publication statusPublished - 2021

Cite this