Skip to main content
SpringerLink
Log in

The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Borsuk's partition conjecture for finite subsets of euclidean space is placed in a graph theoretic setting and equivalent graph theoretic conjectures are raised. The Borsuk dimension of a graph is defined and the Borsuk dimensions of various graphs are tabulated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Borsuk, K.:Drei Sätze über die n-dimensionale euklidische Sphäre. Fundam. Math.20, 177–190 (1933)

    Google Scholar 

  2. Borsuk, K.:Some remarks on covering of bounded subsets of the euclidean n-space with sets of smaller diameter. Demonstr. Math.11, 247–251 (1978)

    Google Scholar 

  3. Buckley, F., Harary, H.:On the euclidean dimension of a wheel. Graphs and Combinatorics4, 23–30 (1988)

    Google Scholar 

  4. Erdös, P.:On sets of distances of n points. Amer. Math. Monthly53, 248–250 (1946)

    Google Scholar 

  5. Erdös, P., Harary, F., Tutte, W.:On the dimension of a graph. Mathematika12, 118–122 (1965)

    Google Scholar 

  6. Grünbaum, B.:Borsuk's problem and related questions. Proc. Symp. Pure Math.7, 271–284 (1963)

    Google Scholar 

  7. Heppes, A.:Beweis einer Vermutung von A. Vázsonji, Acta Math. Acad. Sci. Hung.7, 463–466 (1957)

    Google Scholar 

  8. Heppes, A., Révész, P.:Zum Borsukschen Zerteilungsproblem. Acta Math. Acad. Sci. Hung.7, 159–162 (1956)

    Google Scholar 

  9. Lassak, M.:An estimate concerning Borsuk partition problem. Bull. Acad. Pol. Sci.30, 449–451 (1982)

    Google Scholar 

  10. Lenz, H.:Zur Zerlegung von Punktmengen in solche kleineren Durchmessers. Arch. Math.6, 413–416 (1955)

    Google Scholar 

  11. Maehara, H., Reiterman, J., Rödl, V., Sinajová, E.:Embedding of trees in euclidean spaces. Graphs and Combinatorics4, 43–47 (1988)

    Google Scholar 

  12. Straszewicz, S.:Sur un problème géometrique de P. Erdös. Bull. Acad. Pol. Sci. C1. III5, 39–40 (1957)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Florida State University, 32306-3027, Tallahassee, FL, USA

    Philip L. Bowers

Authors
  1. Philip L. Bowers
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

AMS Subject Classification (1985 Revision): 05C99, 05A17

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bowers, P.L. The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets. Graphs and Combinatorics 6, 207–222 (1990). https://doi.org/10.1007/BF01787572

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787572

Keywords

Search

Navigation