- D. D. Cherkashin, “On the Erdös–Hajnal Problem for 3-Graphs”, J Math Sci, 255, no. 1, 2021, 103
- Arès Méroueh, Andrew Thomason, “List colorings of multipartite hypergraphs”, Random Struct Algorithms, 55, no. 4, 2019, 950
- Jakub Kozik, Dmitry Shabanov, “Improved algorithms for colorings of simple hypergraphs and applications”, Journal of Combinatorial Theory, Series B, 116, 2016, 312
- Margarita Akhmejanova, Dmitry Shabanov, “Colorings of b-simple hypergraphs”, Electronic Notes in Discrete Mathematics, 61, 2017, 29
- Yu. A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Math Notes, 108, no. 1-2, 2020, 188
- DWIGHT DUFFUS, BILL KAY, VOJTĚCH RÖDL, “The Minimum Number of Edges in Uniform Hypergraphs with Property O”, Combinator. Probab. Comp., 27, no. 4, 2018, 531
- Yurii Aleksandrovich Demidovich, Andrei Mikhailovich Raigorodskii, “Двухцветные раскраски однородных гиперграфов”, Математические заметки, 100, no. 4, 2016, 623
- Asaf Ferber, Asaf Shapira, “A quantitative Lovász criterion for Property B”, Combinator. Probab. Comp., 29, no. 6, 2020, 956
- Ilia Akolzin, Dmitry Shabanov, “Colorings of hypergraphs with large number of colors”, Discrete Mathematics, 339, no. 12, 2016, 3020
- M. Akhmejanova, D. A. Shabanov, “Equitable Colorings of Hypergraphs with r Colors”, J Math Sci, 262, no. 4, 2022, 391