电邮这篇文章 On the concentration of the chromatic number of a random hypergraph
- 作者: Shabanov D.1,2,3
-
隶属关系:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Faculty
- Higher School of Economics (National Research University)
- 期: 卷 96, 编号 1 (2017)
- 页面: 321-325
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225187
- DOI: https://doi.org/10.1134/S1064562417040044
- ID: 225187
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
The problem on the limit distribution of the chromatic number of a random uniform hypergraph in the sparse case is studied. It is shown that, for most parameters values, the limit distribution of the chromatic number is concentrated at precisely one point, which can be found explicitly.
作者简介
D. Shabanov
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Higher School of Economics (National Research University)
编辑信件的主要联系方式.
Email: dm.shabanov.msu@gmail.com
俄罗斯联邦, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Moscow, 101000
