Borsuk's problem and the chromatic numbers of some metric spaces
From MaRDI portal
The paper contains various results pertaining to two problems of combinatorial geometry: Borsuk's problem on partitions of an arbitrary bounded \(d\)-dimensional set of non-zero diameter into parts of smaller diameter and the problem of finding chromatic numbers of some metric spaces. The author presents an exposition of the general method for constructing counterexamples to Borsuk's conjecture and obtaining lower bounds for the minimum number of parts of smaller diameter as well as for chromatic numbers of real and rational spaces.
Recommendations
- Borsuk's problem and the chromatic numbers of metric spaces
- On the chromatic number of Euclidean space and the Borsuk problem
- On the chromatic number of metric spaces
- On the chromatic number for a set of metric spaces
- Chromatic numbers of metric spaces
- On the chromatic numbers of metric spaces with few forbidden distances
- Borel chromatic numbers
- The b-chromatic number and related topics -- a survey
- scientific article; zbMATH DE number 68356
- On the chromatic numbers of rational spaces
Cited in
(only showing first 100 items - show all)- Borel chromatic numbers
- New sets with large Borsuk numbers
- On the chromatic numbers of rational spaces
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
- Diameters of random distance graphs
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- The Borsuk partition problem: the seventieth anniversary
- Chromatic numbers of spheres
- Strong Ramsey properties of simplices
- Gigantic component in random distance graphs of special form
- 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
- Distance graphs with large chromatic number and without large cliques
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Bounds on Borsuk numbers in distance graphs of a special type
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On the minimal number of edges in induced subgraphs of special distance graphs
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Estimate of the number of edges in special subgraphs of a distance graph
- A generalization of Kneser graphs
- The Namer-Claimer game
- Density modulo 1 of lacunary and sublacunary sequences: application of Peres-Schlag's construction
- One problem on geometric Ramsey numbers
- Exponentially Ramsey sets
- 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
- 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 _1 and _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
- Counterexamples to Borsuk's conjecture with large girth
- 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
- New upper bound for the chromatic number of a random subgraph of a distance graph
- 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
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- On chromatic numbers of close-to-Kneser distance graphs
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Distance Ramsey numbers
- On simplices in diameter graphs in \(\mathbb{R}^4\)
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- On the chromatic number for a set of metric spaces
- 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
- On the Borsuk and Erdős-Hadwiger numbers
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- On the chromatic number of Euclidean space and the Borsuk problem
- On a series of Ramsey-type problems in combinatorial geometry
- Around Borsuk's hypothesis
- Chromatic numbers of metric spaces
- The geometry of Minkowski spaces -- a survey. II.
- Independence numbers and chromatic numbers of some distance graphs
- On computational complexity of length embeddability of graphs
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
- Small subgraphs in random distance graphs
- Coloring distance graphs and graphs of diameters
- On large subgraphs with small chromatic numbers contained in distance graphs
- On the chromatic numbers of integer and rational lattices
- Independence numbers of random subgraphs of a distance graph
- 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
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- On the distance and multidistance graph embeddability problem
- On the chromatic numbers of metric spaces with few forbidden distances
- Borsuk's problem and the chromatic numbers of metric spaces
- On Ramsey Type Problems in Combinatorial Geometry
- New bounds for the distance Ramsey number
- On Schur's conjecture in \(\mathbb{R}^{4}\)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Small subgraphs and their extensions in a random distance graph
- On the chromatic number of an infinitesimal plane layer
- On the Frankl-Rödl theorem
- The chromatic number of the space \(( {\mathbb R}^n, l_1)\)
- On lower bounds for Borsuk and Hadwiger numbers
- 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
- 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
- All finite sets are Ramsey in the maximum norm
- scientific article; zbMATH DE number 7583734 (Why is no real title available?)
- On rational analogs of Nelson-Hadwiger's and Borsuk's problems
- Гигантская компонента в случайных дистанционных графах специального вида
- On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces
- Ball packings with high chromatic numbers from strongly regular graphs
- Zero-one laws for random graphs with vertices in a Boolean cube
- Three lectures on the Borsuk partition problem
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- The connection between the Borsuk and Erdös-Hadwiger problems
- Covering planar sets
This page was built for publication: Borsuk's problem and the chromatic numbers of some metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784519)
