Three lectures on the Borsuk partition problem
From MaRDI portal
Publication:5301263
zbMATH Open1144.52005MaRDI QIDQ5301263FDOQ5301263
Publication date: 29 April 2008
Recommendations
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other problems of combinatorial convexity (52A37)
Cited In (33)
- New bounds for the distance Ramsey number
- Title not available (Why is that?)
- Independence numbers and chromatic numbers of some distance graphs
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On threshold probability for the stability of independent sets in 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 graphs
- Sets with large Borsuk number
- 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
- Diameters of random distance graphs
- Diameter graphs in \({\mathbb R}^4\)
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance graphs
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- Borsuk's problem, Boltyanski's illumination problem, and circumradius
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
- Hamiltonian paths in distance graphs
- New bounds on clique-chromatic numbers of Johnson 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
- Systems of representatives
- Small subgraphs in random distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- On Schur's conjecture in \(\mathbb R^4\)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's partition problem and finite point sets
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Partition of three-dimensional sets into five parts of smaller diameter
- Title not available (Why is that?)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On \(k\)-diametral point configurations in Minkowski spaces
- Estimate of the number of edges in special subgraphs of a distance graph
- Borsuk's partition conjecture
- The number of edges in induced subgraphs of some distance graphs
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)