Skip to main content

Borsuk’s conjecture

  • Chapter
Proofs from THE BOOK

Abstract

Karol Borsuk’s paper “Three theorems on the n-dimensional euclidean sphere” from 1933 is famous because it contained an important result (conjectured by Stanislaw Ulam) that is now known as the Borsuk-Ulam theorem:

Every continuous map f: Sd → ℝd maps two antipodal points of the sphere Sd to the same point in ℝd.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Borsuk: Drei Sästze über die n-dimensionale euklidische Sphäsre, Funda-menta Math. 20 (1933), 177–190.

    Google Scholar 

  2. A. Hinrichs & C. Richter: New sets with large Borsuk numbers,Preprint, February 2002, 10 pages; Discrete Math., to appear.

    Google Scholar 

  3. J. Kahn & G. Kalai: A counterexample to Borsuk’s conjecture, Bulletin Amer. Math. Soc. 29 (1993), 60–62.

    Article  MathSciNet  MATH  Google Scholar 

  4. A. Nilli: On Borsuk’s problem, in: “Jerusalem Combinatorics 93” (H. Barcelo and G. Kalai, eds.), Contemporary Mathematics 178, Amer. Math. Soc. 1994, 209–210.

    Chapter  Google Scholar 

  5. A. M. Raigorodskii: On the dimension in Borsuk’s problem,Russian Math. Surveys (6) 52 (1997), 1324–1325.

    Article  MathSciNet  MATH  Google Scholar 

  6. O. Schramm: Illuminating sets of constant width, Mathematika 35 (1988), 180–199.

    Article  MathSciNet  MATH  Google Scholar 

  7. B. Weissbach: Sets with large Borsuk number, Beiträsge zur Algebra undGeometrie/Contributions to Algebra and Geometry 41 (2000), 417–423.

    MathSciNet  MATH  Google Scholar 

  8. G. M. Zlegler: Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions, Lecture Notes in Computer Science 2122, Springer-Verlag 2001, 164–175.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aigner, M., Ziegler, G.M. (2004). Borsuk’s conjecture. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05412-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05412-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-05414-7

  • Online ISBN: 978-3-662-05412-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics