The jump of the clique chromatic number of random graphs
The jump of the clique chromatic number of random graphs
复制标题
随机图的团色数的跳跃
DOI:
10.1002/rsa.21128
复制
发表时间:
2023
影响因子:
1
通讯作者:
Warnke, Lutz
中科院分区:
文献类型:
--
作者:
Lichev, Lyuben;Mitsche, Dieter;Warnke, Lutz
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In 2016 McDiarmid, Mitsche and Prałat noted that around p≈n−1/2$$ p\approx {n}^{-1/2} $$ the clique chromatic number of the random graph Gn,p$$ {G}_{n,p} $$ changes by nΩ(1)$$ {n}^{\Omega (1)} $$ when we increase the edge‐probability p$$ p $$ by no(1)$$ {n}^{o(1)} $$, but left the details of this surprising “jump” phenomenon as an open problem. We settle this problem, that is, resolve the nature of this polynomial “jump” of the clique chromatic number of the random graph Gn,p$$ {G}_{n,p} $$ around edge‐probability p≈n−1/2$$ p\approx {n}^{-1/2} $$. Our proof uses a mix of approximation and concentration arguments, which enables us to (i) go beyond Janson's inequality used in previous work and (ii) determine the clique chromatic number of Gn,p$$ {G}_{n,p} $$ up to logarithmic factors for any edge‐probability p$$ p $$.
登录
查看更多内容
影响因子:
0.7
作者:
G. Joret;Piotr Micek;B. Reed;M. Smid
通讯作者:
M. Smid
DOI:
10.37236/8493
发表时间:
2020
期刊:
The Electronic Journal of Combinatorics
影响因子:
--
作者:
Šileikis, Matas;Warnke, Lutz
通讯作者:
Warnke, Lutz
DOI:
10.1016/j.jctb.2019.05.003
发表时间:
2019
期刊:
Series B
影响因子:
--
作者:
Warnke, Lutz
通讯作者:
Warnke, Lutz
影响因子:
0.9
作者:
Guo, He;Warnke, Lutz
通讯作者:
Warnke, Lutz
影响因子:
1
作者:
L. Warnke
通讯作者:
L. Warnke