Skip to main content

Heilbronn Problem for Six Points in a Planar Convex Body

  • Chapter
Minimax and Applications

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 4))

Abstract

For any six points in a planar convex body K there must be at least one triangle, formed by three of these points, with area not greater than 1/6 of the area of K. This upper bound 1/6 is best possible.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Goldberg, M., Maximizing the smallest triangle made by points in a square, Math. Mag., 45 (1972), 135–144.

    Article  MathSciNet  MATH  Google Scholar 

  2. Komlos, J. et al., On Heilbronn’s problem, J. London Math. Soc. (2), 24 (1981), 385–396.

    Article  MathSciNet  MATH  Google Scholar 

  3. Komlos, J. et al., A lower bound for Heilbronn’s problem, J. London Math. Soc. (2), 25 (1982), 13–14.

    Article  MathSciNet  MATH  Google Scholar 

  4. Moser, W., Problems on extremal properties of a finite set of points, in “Discrete Geometry and Convexity”, Ann. New York Acad. Sci., 440 (1985), 52–64.

    Article  Google Scholar 

  5. Moser, W. & Pach,J., “100 Research Problem in Discrete Geometry”, MacGill University, Montreal, Que. 1986.

    Google Scholar 

  6. Roth, K.F., On a problem of Heilbronn, J. London Math. Soc., 26 (1951), 198–204.

    Article  MathSciNet  MATH  Google Scholar 

  7. Roth, K.F., On a problem of Heilbronn II, Proc. London Math. Soc., 25 (1972), 193–212.

    MATH  Google Scholar 

  8. Roth, K.F., On a problem of Heilbronn III, Proc. London Math. Soc., 25 (1974), 543–549.

    Google Scholar 

  9. Roth, K.F., Estimation of the area of the smallest triangle obtained by selecting three out of n points in a disc of unit area, Amer. Math. Soc. Proc. Symp. Pure Math., 24: 251–262, 1973.

    Google Scholar 

  10. Roth, K.F., Developments in Heilbronn’s triangle problem, Advances in Math., 22 (1976), 364–385.

    Article  MathSciNet  MATH  Google Scholar 

  11. Schmidt, W.M., On a problem of Heilbronn, J. London Math. Soc. (2), 4 (1971), 545–550.

    Article  MathSciNet  Google Scholar 

  12. Yang Lu & Zhang Jingzhong, The problem of 6 points in a square, in “Lectures in Math. (2)”, 151–175, Sichuan People’s Publishing House 1980, pp. 151–175. (in Chinese).

    Google Scholar 

  13. Yang Lu & Zhang Jingzhong, A conjecture concerning six points in a square, in “Mathematical Olympiad in China”, Hunan Education Publishing House 1990.

    Google Scholar 

  14. Yang Lu, Zhang Jingzhong & Zeng Zhenbing, On the conjecture and computing for exact values of the first several Heilbronn numbers, Chin. Ann. Math.(A), 13: 4 (1992), 503–515. (in Chinese).

    MATH  Google Scholar 

  15. Yang Lu, Zhang Jingzhong & Zeng Zhenbing, On the first several Heilbronn numbers of a triangle, Acta Math. Sinica, 37: 5 (1994), 678–689. (in Chinese).

    MathSciNet  MATH  Google Scholar 

  16. Yang Lu, Zhang Jingzhong & Zeng Zhenbing, Heilbronn problem for five points, Preprint, International Centre for Theoretical Physics, 1991, IC/91/252.

    Google Scholar 

  17. Yang Lu, Zhang Jingzhong & Zeng Zhenbing, On Goldberg’s conjecture: computing the first several Heilbronn numbers, Preprint, Universitat Bielefeld, 1991, ZiF–Nr.91/29, SFB-Nr.91/074.

    Google Scholar 

  18. Yang Lu, Zhang Jingzhong & Zeng Zhenbing, Searching dependency between algebraic equations: an algorithm applied to automated reasoning, Preprint, International Centre for Theoretical Physics, 1991, IC/91/6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Kluwer Academic Publishers

About this chapter

Cite this chapter

Dress, A.W.M., Yang, L., Zeng, Z. (1995). Heilbronn Problem for Six Points in a Planar Convex Body. In: Du, DZ., Pardalos, P.M. (eds) Minimax and Applications. Nonconvex Optimization and Its Applications, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3557-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3557-3_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3559-7

  • Online ISBN: 978-1-4613-3557-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics