Yu. A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Math Notes, 108, № 1-2, 2020, 188
Musavarah Sarwar, Gohar Ali, “A Theoretical Investigation Based on the Rough Approximations of Hypergraphs”, Journal of Mathematics, 2022, 2022, 1
F. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the Number of Edges in Subgraphs of a Johnson Graph”, Dokl. Math., 104, № 1, 2021, 193
V. S. Karas, P. A. Ogarok, A. M. Raigorodskii, “Asymptotics of the Independence Number of a Random Subgraph of the Graph G(n, r, < s)”, Dokl. Math., 104, № 1, 2021, 173
Ilya O. Denisov, Dmitriy A. Shabanov, “On the concentration of the independence numbers of random hypergraphs”, Discrete Mathematics and Applications, 33, № 1, 2023, 7
P. A. Zakharov, D. A. Shabanov, “On the Maximal Cut in a Random Hypergraph”, Dokl. Math., 104, № 3, 2021, 336
T. G. Matveeva, A. E. Khuzieva, D. A. Shabanov, “On the Strong Chromatic Number of Random Hypergraphs”, Dokl. Math., 105, № 1, 2022, 31
A. S. Semenov, D. A. Shabanov, “Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs”, Probl Inf Transm, 58, № 1, 2022, 72
Yurii Aleksandrovich Demidovich, Dmitry Aleksandrovich Shabanov, “О двух предельных значениях хроматического числа случайного гиперграфа”, Теория вероятностей и ее применения, 67, № 2, 2022, 223
I. O. Denisov, D. A. Shabanov, “ON THE CONCENTRATION OF VALUES OF <i>j</i>-CHROMATIC NUMBERS OF RANDOM HYPERGRAPHS”, Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, 509, № 1, 2023, 28