А. М. Райгородский, Д. Д. Черкашин, “Экстремальные задачи в раскрасках гиперграфов”, УМН, 75:1(451) (2020), 95–154 ; A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
Dmitry A. Shabanov, “Coloring non-uniform hypergraphs without short cycles”, Graphs Comb., 30:5 (2014), 1249–1260
Heidi Gebauer, “On the construction of 3-chromatic hypergraphs with few edges”, Journal of Combinatorial Theory, Series A, 120:7 (2013), 1483
Dmitry A. Shabanov, “Random coloring method in the combinatorial problem of Erdős and Lovász”, Random Structures Algorithms, 40:2 (2012), 227–253
Dmitry A. Shabanov, “On $r$-chromatic hypergraphs”, Discrete Math., 312:2 (2012), 441–458
А. М. Райгородский, Д. А. Шабанов, “Задача Эрдеша–Хайнала о раскрасках гиперграфов, ее обобщения и смежные проблемы”, УМН, 66:5(401) (2011), 109–182 ; A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Russian Math. Surveys, 66:5 (2011), 933–1002
D. D. Cherkashin, A. B. Kulikov, “On two-colorings of hypergraphs”, Dokl. Math., 83:1 (2011), 68
D. A. Shabanov, “Lower bounds for the number of edges in hypergraphs of certain classes”, Dokl. Math., 82:2 (2010), 705