Estimating the chromatic numbers of Euclidean space by convex minimization methods
From MaRDI portal
Publication:3646309
DOI10.1070/SM2009v200n06ABEH004019zbMath1250.05048MaRDI QIDQ3646309
Vladimir Yu. Protasov, E. S. Gorskaya, I. M. Mitricheva, Andrei M. Raigorodskii
Publication date: 20 November 2009
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm2009v200n06abeh004019
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C63: Infinite graphs
Related Items
The chromatic number of the space $( {\mathbb R}^n, l_1)$, Zero-one laws for random graphs with vertices in a Boolean cube, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances, New bounds for the chromatic number of a space with forbidden isosceles triangles, Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections, On the chromatic number of with an arbitrary norm, Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric, Distance graphs with large chromatic numbers and small clique numbers, Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size, A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\), New lower bound for the chromatic number of a rational space with one and two forbidden distances, New lower bounds for the chromatic number of a space with forbidden isosceles triangles
