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 条
  • [41] Hypergraphs with Zero Chromatic Threshold
    Balogh, Jozsef
    Lenz, John
    GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1249 - 1262
  • [42] THE CHROMATIC INDEX OF SIMPLE HYPERGRAPHS
    FUREDI, Z
    GRAPHS AND COMBINATORICS, 1986, 2 (01) : 89 - 92
  • [43] 3-CHROMATIC HYPERGRAPHS
    BECK, J
    DISCRETE MATHEMATICS, 1978, 24 (02) : 127 - 137
  • [44] The circular chromatic number of hypergraphs
    Brewster, Richard C.
    MacGillivray, Gary
    Shepherd, Laura
    DISCRETE MATHEMATICS, 2009, 309 (18) : 5757 - 5765
  • [45] THE CHROMATIC NUMBER OF KNESER HYPERGRAPHS
    ALON, N
    FRANKL, P
    LOVASZ, L
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1986, 298 (01) : 359 - 370
  • [46] Chromatic index of simple hypergraphs
    Zhang, Guo-Hui
    Skinner, Brett
    DISCRETE MATHEMATICS, 2020, 343 (12)
  • [47] Chromatic capacities of graphs and hypergraphs
    Greene, JE
    DISCRETE MATHEMATICS, 2004, 281 (1-3) : 197 - 207
  • [48] Circular chromatic number of hypergraphs
    Eslahchi, C
    Rafiey, A
    ARS COMBINATORIA, 2004, 73 : 239 - 246
  • [49] Chromatic-Choosability of Hypergraphs with High Chromatic Number
    Wang, Wei
    Qian, Jianguo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (01):
  • [50] Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
    Zhang, Ruixue
    Dong, Fengming
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 64 : 138 - 151
12345