On the Chromatic Numbers of Random Hypergraphs

被引：0
|
作者：
Demidovich, Yu A. [1 ]
Shabanov, D. A. [1 ,2 ,3 ]
机构：
[1] Natl Res Univ, Moscow Inst Phys & Technol, Dolgoprudnyi 141701, Moscow Oblast, Russia
[2] Lomonosov Moscow State Univ, Fac Mech & Math, Moscow 119991, Russia
[3] Natl Res Univ, Higher Sch Econ, Moscow 101000, Russia
来源：
DOKLADY MATHEMATICS | 2020年 / 102卷 / 02期
基金：
俄罗斯科学基金会;
关键词：
random hypergraph; chromatic number; second moment method;
D O I：
10.1134/S1064562420050312
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The asymptotic behavior of the chromatic number of the binomial random hypergraph H(n,k,p) is studied in the case when is l >= 4 fixed, n tends to infinity, and p = p(n) is a function. If p = p(n) does not decrease too slowly, we prove that the chromatic number of is concentrated in two or three consecutive values, which can be found explicitly as functions of n, p, and k.
引用
收藏
页码：380 / 383
页数：4
相关论文
共 50 条
12345