Amir Jafari, Mohammad Javad Moghaddamzadeh, “On the chromatic number of generalized Kneser graphs and Hadamard matrices”, Discrete Mathematics, 343, no. 2, 2020, 111682
Mikhail M. Koshelev, “Lower bounds on the clique-chromatic numbers of some distance graphs”, Moscow J. Comb. Number Th., 10, no. 2, 2021, 141
F. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the Number of Edges in Special Subgraphs of a Distance Graph”, Math Notes, 107, no. 1-2, 2020, 322
Yury A. Demidovich, “New lower bound for the minimal number of edges of simple uniform hypergraph without the property Bk”, Discrete Mathematics and Applications, 32, no. 3, 2022, 155
Ya. K. Shubin, “Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs”, Probl Inf Transm, 58, no. 4, 2022, 382
Andrei Mikhailovich Raigorodskii, Danila Dmitrievich Cherkashin, “Экстремальные задачи в раскрасках гиперграфов”, Успехи математических наук, 75, no. 1(451), 2020, 95
Yu. A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Math Notes, 108, no. 1-2, 2020, 188
Vladislav Kozhevnikov, Maksim Zhukovskii, “Large cycles in generalized Johnson graphs”, Journal of Graph Theory, 104, no. 4, 2023, 904
M. M. Ipatov, M. M. Koshelev, A. M. Raigorodskii, “Modularity of Some Distance Graphs”, Dokl. Math., 101, no. 1, 2020, 60
Philipp Anatolevich Pushnyakov, Andrei Mikhailovich Raigorodskii, “Оценка числа ребер в особых подграфах некоторого дистанционного графа”, Математические заметки, 107, no. 2, 2020, 286