The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
From MaRDI portal
Publication:1173653
DOI10.1007/BF01787572zbMath0744.05057OpenAlexW2001991550WikidataQ122877356 ScholiaQ122877356MaRDI QIDQ1173653
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01787572
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding of trees in Euclidean spaces
- On the Euclidean dimension of a wheel
- Zur Zerlegung von Punktmengen in solche kleineren Durchmessers
- Zum Borsukschen Zerteilungsproblem
- SOME REMARKS ON COVERING OF BOUNDED SUBSETS OF THE EUCLIDEAN n-SPACE WITH SETS OF SMALLER DIAMETER
- On the dimension of a graph
- On Sets of Distances of n Points
This page was built for publication: The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets