Two-colorings of a~random hypergraph
Teoriâ veroâtnostej i ee primeneniâ, Tome 64 (2019) no. 1, pp. 75-97
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper is concerned with the study of the threshold probability for the
existence of a two-coloring for a special random $k$-uniform hypergraph in
a binomial model.
The first- and second-moment methods are employed to derive upper and lower
estimates for the desired threshold probability.
Keywords:
hypergraph, colorings of a hypergraph, $j$-chromatic number.
@article{TVP_2019_64_1_a4,
author = {A. S. Semenov},
title = {Two-colorings of a~random hypergraph},
journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
pages = {75--97},
publisher = {mathdoc},
volume = {64},
number = {1},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TVP_2019_64_1_a4/}
}
A. S. Semenov. Two-colorings of a~random hypergraph. Teoriâ veroâtnostej i ee primeneniâ, Tome 64 (2019) no. 1, pp. 75-97. http://geodesic.mathdoc.fr/item/TVP_2019_64_1_a4/