Three lectures on the Borsuk partition problem

Publication date 29 April 2008

chromatic number diameter partitioning Borsuk problem

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other problems of combinatorial convexity (52A37)

Recommendations

Around Borsuk's hypothesis
Borsuk's partition conjecture
Borsuk's problem and the chromatic numbers of some metric spaces
On the Borsuk problem in \(\mathbb R^ 3\).
Borsuk's partition problem in ℓₚ⁴

Cited in

(33)

On threshold probability for the stability of independent sets in distance graphs
Partition of three-dimensional sets into five parts of smaller diameter
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
Independence numbers of random subgraphs of distance graphs
New bounds for the distance Ramsey number
Estimates of the Number of Edges in Subgraphs of Johnson Graphs
Borsuk's problem, Boltyanski's illumination problem, and circumradius
scientific article; zbMATH DE number 1064598 (Why is no real title available?)
New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
scientific article; zbMATH DE number 2070003 (Why is no real title available?)
On \(k\)-diametral point configurations in Minkowski spaces
Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
Hamiltonian paths in distance graphs
New bounds on clique-chromatic numbers of Johnson graphs
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
Estimate of the number of edges in special subgraphs of a distance graph
Sets with large Borsuk number
Counterexamples to Borsuk's conjecture with large girth
The number of edges in induced subgraphs of some distance graphs
Diameters of random distance graphs
On the number of edges in induced subgraphs of a special distance graph
A new estimate for the number of edges in induced subgraphs of a special distance graph
Diameter graphs in \({\mathbb R}^4\)
On the maximal number of edges in a uniform hypergraph with one forbidden intersection
Independence numbers and chromatic numbers of some distance graphs
Borsuk's partition conjecture
On Schur's conjecture in \(\mathbb R^4\)
Small subgraphs in random distance graphs
Independence numbers of random subgraphs of a distance graph
Borsuk's partition problem and finite point sets
Systems of representatives

This page was built for publication: Three lectures on the Borsuk partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301263)