7 citations to https://www.mathnet.ru/eng/rsa1
-
A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
-
Margarita Akhmejanova, Dmitry Shabanov, “Coloring hypergraphs with bounded cardinalities of edge intersections”, Discrete Mathematics, 343:4 (2020), 111692
-
Andrey Kupavskii, Dmitry Shabanov, “Colourings of uniform hypergraphs with large girth and applications”, Comb. Probab. Comput., 27:2 (2018), 245–273
-
Jakub Kozik, “Multipass greedy coloring of simple uniform hypergraphs”, Random Struct. Alg., 48:1 (2016), 125
-
Jakub Kozik, Dmitry Shabanov, “Improved algorithms for colorings of simple hypergraphs and applications”, J. Comb. Theory, Ser. B, 116 (2016), 312–332
-
D. A. Shabanov, “A generalization of the Hajnal–Szemeredi theorem for uniform hypergraphs”, Dokl. Math., 90:3 (2014), 671–674
-
A. B. Kupavskii, D. A. Shabanov, “Colorings of partial Steiner systems and their applications”, J. Math. Sci., 206:5 (2015), 511–538