A. A. Sagdeev, “On a Frankl-Wilson Theorem”, Probl Inf Transm, 55, no. 4, 2019, 376
Roman Prosanov, “A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space”, Discrete Applied Mathematics, 276, 2020, 115
Yurii Aleksandrovich Demidovich, “Дистанционные графы в рациональном пространстве с большим хроматическим числом и без клик заданного размера”, Математические заметки, 106, no. 1, 2019, 24
A. M. Raigorodskii, T. V. Trukhan, “On the Chromatic Numbers of Some Distance Graphs”, Dokl. Math., 98, no. 2, 2018, 515
D. A. Zakharov, “Chromatic Numbers of Some Distance Graphs”, Math Notes, 107, no. 1-2, 2020, 238
Andrey Kupavskii, Arsenii Sagdeev, “All finite sets are Ramsey in the maximum norm”, Forum of Mathematics, Sigma, 9, 2021, e55
Roman Prosanov, “Chromatic numbers of spheres”, Discrete Mathematics, 341, no. 11, 2018, 3123
R. I. Prosanov, “Counterexamples to Borsuk’s Conjecture with Large Girth”, Math Notes, 105, no. 5-6, 2019, 874
A. V. Berdnikov, A.M. Raigorodskii, “Bounds on Borsuk Numbers in Distance Graphs of a Special Type”, Probl Inf Transm, 57, no. 2, 2021, 136
József Balogh, Danila Cherkashin, Sergei Kiselev, “Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs”, European Journal of Combinatorics, 79, 2019, 228