Distance graphs having large chromatic numbers and not containing cliques or cycles of given size

Evgeniy Demekhin, Andrei Raigorodskii, Oleg Rubanov

In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {…