A new lower bound for the chromatic number of the rational space
From MaRDI portal
Publication:5396401
DOI10.1070/RM2013v068n05ABEH004865zbMath1286.05051MaRDI QIDQ5396401
E. I. Ponomarenko, Andrei M. Raigorodskii
Publication date: 5 February 2014
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Related Items (5)
On the chromatic number of an infinitesimal plane layer ⋮ Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
This page was built for publication: A new lower bound for the chromatic number of the rational space
