This article is cited in 9 papers

Two-colorings of a random hypergraph

A. S. Semenov<sup>ab

a</sup> 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

DOI: 10.4213/tvp5165

 English version: Theory of Probability and its Applications, 2019, 64:1, 59–77

Bibliographic databases:

• 
• 
• 
• 
•