Email this article On the concentration of the chromatic number of a random hypergraph
- Authors: Shabanov D.A.1,2,3
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Faculty
- Higher School of Economics (National Research University)
- Issue: Vol 96, No 1 (2017)
- Pages: 321-325
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225187
- DOI: https://doi.org/10.1134/S1064562417040044
- ID: 225187
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
D. A. Shabanov
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Higher School of Economics (National Research University)
Author for correspondence.
Email: dm.shabanov.msu@gmail.com
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Moscow, 101000
