Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Demekhin, Evgeniy"'
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 $ {\mathbb R}^n $, i.e., graphs such that their vertices are vectors and
Externí odkaz:
http://arxiv.org/abs/1202.2968
