On the chromatic number of graphons

M. Isaev; M. Kang

On the chromatic number of graphons

Institute of Discrete Mathematics (5050)

Research output: Working paper › Preprint

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 language	English
Publication status	Published - 2021

Access to Document

https://arxiv.org/abs/2109.07773

Cite this

@techreport{f27dcae845714869b60aba9c5570630c,

title = "On the chromatic number of graphons",

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",

author = "M. Isaev and M. Kang",

year = "2021",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - On the chromatic number of graphons

AU - Isaev, M.

AU - Kang, M.

PY - 2021

Y1 - 2021

N2 - 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

AB - 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

M3 - Preprint

BT - On the chromatic number of graphons

ER -

On the chromatic number of graphons

Abstract

Access to Document

Fingerprint

Cite this