On the concentration of the chromatic number of a random hypergraph
- Autores: Shabanov D.A.1,2,3
-
Afiliações:
- Moscow Institute of Physics and Technology (State University)
- Mechanics and Mathematics Faculty
- Higher School of Economics (National Research University)
- Edição: Volume 96, Nº 1 (2017)
- Páginas: 321-325
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225187
- DOI: https://doi.org/10.1134/S1064562417040044
- ID: 225187
Citar
Resumo
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.
Sobre autores
D. Shabanov
Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Higher School of Economics (National Research University)
Autor responsável pela correspondência
Email: dm.shabanov.msu@gmail.com
Rússia, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Moscow, 101000
Arquivos suplementares
