scientific article

From MaRDI portal
Publication:3020323

zbMath1227.05003MaRDI QIDQ3020323

Andrei M. Raigorodskii

Publication date: 4 August 2011


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (21)

Lovász' theorem on the chromatic number of spheres revisitedOn large subgraphs with small chromatic numbers contained in distance graphsOn the chromatic numbers of integer and rational latticesEstimate for the chromatic number of Euclidean space with several forbidden distancesOn chromatic numbers of nearly Kneser distance graphsOn the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spacesSmall subgraphs and their extensions in a random distance graphOn the chromatic number of an infinitesimal plane layerChromatic number with several forbidden distances in the space with the \(\ell_q\)-metricAn improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edgesImprovements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangleThe chromatic number of the space $( {\mathbb R}^n, l_1)$Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distanceOn the chromatic numbers of small-dimensional Euclidean spacesOne problem on geometric Ramsey numbersSmall Subgraphs in Random Distance GraphsГигантская компонента в случайных дистанционных графах специального видаNew upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphsOn large subgraphs of a distance graph which have small chromatic numberNew lower bound for the chromatic number of a rational space with one and two forbidden distancesNew lower bounds for the chromatic number of a space with forbidden isosceles triangles




This page was built for publication: