English

Borsuk and V\'azsonyi problems through Reuleaux polyhedra

Combinatorics 2025-07-24 v2 Metric Geometry

Abstract

The Borsuk conjecture and the V\'azsonyi problem are two attractive and famous questions in discrete and combinatorial geometry, both based on the notion of diameter of a bounded sets. In this paper, we present an equivalence between the critical sets with Borsuk number 4 in R3\mathbb{R}^3 and the minimal structures for the V\'azsonyi problem by using the well-known Reuleaux polyhedra. The latter lead to a full characterization of all finite sets in R3\mathbb{R}^3 with Borsuk number 4. The proof of such equivalence needs various ingredients, in particular, we proved a conjecture dealing with strongly critical configuration for the V\'azsonyi problem and showed that the diameter graph arising from involutive polyhedra is vertex (and edge) 4-critical.

Keywords

Cite

@article{arxiv.2308.03889,
  title  = {Borsuk and V\'azsonyi problems through Reuleaux polyhedra},
  author = {Gyivan Lopez-Campos and Deborah Oliveros and Jorge L. Ramírez Alfonsín},
  journal= {arXiv preprint arXiv:2308.03889},
  year   = {2025}
}
R2 v1 2026-06-28T11:50:20.670Z