Borsuk's problem and the chromatic numbers of some metric spaces
From MaRDI portal
Publication:2784519
DOI10.1070/rm2001v056n01ABEH000358zbMath1008.54018MaRDI QIDQ2784519
Publication date: 4 June 2002
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Metric spaces, metrizability (54E35) Coloring of graphs and hypergraphs (05C15) Combinatorial geometries and geometric closure systems (51D20)
Related Items (only showing first 100 items - show all)
On the chromatic numbers of low-dimensional spaces ⋮ On the chromatic number of a space with a forbidden regular simplex ⋮ On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ On chromatic numbers of close-to-Kneser distance graphs ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On large subgraphs with small chromatic numbers contained in distance graphs ⋮ On the chromatic numbers of integer and rational lattices ⋮ Strong Ramsey properties of simplices ⋮ Independence numbers of random subgraphs of a distance graph ⋮ On computational complexity of length embeddability of graphs ⋮ Distance Ramsey numbers ⋮ On embedding of finite distance graphs with large chromatic number in random graphs ⋮ Estimate for the chromatic number of Euclidean space with several forbidden distances ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ On the minimal number of edges in induced subgraphs of special distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ On the chromatic numbers of rational spaces ⋮ Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ On the distance and multidistance graph embeddability problem ⋮ On simplices in diameter graphs in \(\mathbb{R}^4\) ⋮ Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ Small subgraphs and their extensions in a random distance graph ⋮ Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm ⋮ On the chromatic number of an infinitesimal plane layer ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ Gigantic component in random distance graphs of special form ⋮ New bounds for the distance Ramsey number ⋮ Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric ⋮ Diameters of random distance graphs ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ On lower bounds for the chromatic number of sphere ⋮ On Schur's conjecture in \(\mathbb{R}^{4}\) ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ On Ramsey Type Problems in Combinatorial Geometry ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On complexity of multidistance graph recognition in \(\mathbb{R}^1\) ⋮ Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the chromatic number of with an arbitrary norm ⋮ New sets with large Borsuk numbers ⋮ On the probability of the occurrence of a copy of a fixed graph in a random distance graph ⋮ Chromatic numbers of spaces with forbidden monochromatic triangles ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ Tree components in random distance graphs of special form ⋮ On the chromatic number for a set of metric spaces ⋮ On the Frankl–Rödl theorem ⋮ Distance graphs with large chromatic number and without large cliques ⋮ On the chromatic numbers of spheres in \(\mathbb R^n\) ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ The Namer-Claimer game ⋮ On the chromatic number of \(\mathbb{R}^{9}\) ⋮ On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs ⋮ Improvements 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 triangle ⋮ On the stability of the Erdös-Ko-Rado theorem ⋮ The 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 distance ⋮ The chromatic number of space with forbidden regular simplex ⋮ Colorings of spaces, and random graphs ⋮ On the Borsuk and Erdős-Hadwiger numbers ⋮ Colorings of the space \(\mathbb R^{n}\) with several forbidden distances ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ Density modulo 1 of lacunary and sublacunary sequences: application of Peres-Schlag's construction ⋮ One problem on geometric Ramsey numbers ⋮ The Borsuk partition problem: the seventieth anniversary ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ An exact result for \((0, \pm 1)\)-vectors ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ On a series of Ramsey-type problems in combinatorial geometry ⋮ Around Borsuk's hypothesis ⋮ Chromatic numbers of metric spaces ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Diameter graphs in \({\mathbb R}^4\) ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces ⋮ Hamiltonian paths in distance graphs ⋮ Small Subgraphs in Random Distance Graphs ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ On lower bounds for the chromatic number of spheres ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm ⋮ 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 graphs ⋮ On the chromatic numbers of metric spaces with few forbidden distances ⋮ Borsuk's problem and the chromatic numbers of metric spaces ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) ⋮ On Schur's conjecture in \(\mathbb R^4\) ⋮ New lower bound for the chromatic number of a rational space with one and two forbidden distances ⋮ Independence numbers and chromatic numbers of some distance graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles
This page was built for publication: Borsuk's problem and the chromatic numbers of some metric spaces
