On the Concentration of Values of j-Chromatic Numbers of Random Hypergraphs

被引：0

作者：

I. O. Denisov

D. A. Shabanov

机构：

[1] Faculty of Mechanics and Mathematics,

[2] Lomonosov Moscow State University,undefined

[3] HSE University,undefined

[4] Moscow Institute of Physics and Technology,undefined

来源：

Doklady Mathematics | 2023年 / 107卷

关键词：

random hypergraph; colorings of hypergraphs; -chromatic number; probability thresholds; second moment method;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：21 / 27

页数：6

共 43 条

[1]

Grimmett G. R.(1975)On colouring random graphs Math. Proc. Cambridge Philos. Soc. 77 313-324

[2]

McDiarmid C. J.(1988)The chromatic number of random graphs Combinatorica 8 49-56

[3]

B. Bollobás T.(1991)The chromatic number of random graphs Combinatorica 11 45-54

[4]

Łuczak T.(1991)A note on the sharp concentration of the chromatic number of random graphs Combinatorica 11 295-297

[5]

Łuczak N.(1997)The concentration of the chromatic number of random graphs Combinatorica 17 303-313

[6]

Alon M.(2005)The two possible values of the chromatic number of a random graph Ann. Math. 162 1335-1351

[7]

Krivelevich D.(2008)On the chromatic number of random graphs J. Comb. Theory Ser. B 98 980-993

[8]

Achlioptas A.(2019)Two values of the chromatic number of a sparse random graph Acta Math. Univ. Comenianae 88 849-854

[9]

Naor A.(2015)The chromatic number of random graphs for most average degrees Int. Math. Res. Not. 2016 5801-5859

[10]

Coja-Oghlan K.(2013)Upper-bounding the Electron. J. Comb. 20 32-362