2 papers
math.CO2015
On the chromatic numbers of small-dimensional Euclidean spaces
Danila Cherkashin, Anatoly Kulikov, Andrey Raigorodskii
The paper is devoted to the study of graph sequence G_n = (V_n, E_n) where V_n is the set of all vectors v in R^n with coordinates from {-1, 0, 1} such that |v| = sqrt(3), and E_n…
math.CO2011
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
D. D. Cherkashin, A. B. Kulikov, A. M. Raigorodskii
In 1973 P. Erdős and L. Lovász noticed that any hypergraph whose edges are pairwise intersecting has chromatic number 2 or 3. In the first case, such hypergraph may have any number…