The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets (Q1173653): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SOME REMARKS ON COVERING OF BOUNDED SUBSETS OF THE EUCLIDEAN n-SPACE WITH SETS OF SMALLER DIAMETER / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Euclidean dimension of a wheel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3237947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zum Borsukschen Zerteilungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Zerlegung von Punktmengen in solche kleineren Durchmessers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of trees in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241604 / rank
 
Normal rank

Latest revision as of 09:42, 15 May 2024

scientific article
Language Label Description Also known as
English
The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
scientific article

    Statements

    The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    Borsuk's partition conjecture
    0 references
    Borsuk dimension
    0 references
    0 references