|
This article is cited in 9 scientific papers (total in 9 papers)
Two-colorings of a random hypergraph
A. S. Semenovab a Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
Abstract:
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.
Received: 16.09.2017 Revised: 23.11.2018 Accepted: 26.11.2018
Citation:
A. S. Semenov, “Two-colorings of a random hypergraph”, Teor. Veroyatnost. i Primenen., 64:1 (2019), 75–97; Theory Probab. Appl., 64:1 (2019), 59–77
Linking options:
https://www.mathnet.ru/eng/tvp5165https://doi.org/10.4213/tvp5165 https://www.mathnet.ru/eng/tvp/v64/i1/p75
|
Statistics & downloads: |
Abstract page: | 364 | Full-text PDF : | 52 | References: | 55 | First page: | 13 |
|