Skip to main content
SpringerLink
Log in

Qualitative Infinite Version of Erdős’ Problem About Empty Polygons

  • Chapter
Discrete and Computational Geometry

Part of the book series: Algorithms and Combinatorics ((AC,volume 25))

  • 1508 Accesses

Abstract

The well-known problem of Erdős-Szekeres in Discrete Geometry is about realizations of convex polygons P with a given number of vertices in a finite set F ⊂ ℝ2, which means that V (P), the vertex set of P, is a subset of F [[5]],[[6]]. See the very good survey [[11]].

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

Access this chapter

Log in via an institution
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. T. Bisztriczky, V. Soltan, Some Erdös-Szekeres type results about points in space, Monatsh. Math. 118 (1994) 33-40.

    MathSciNet  MATH  Google Scholar 

  2. T. Bisztriczky, H. Harborth, On empty convex polytopes, J. Geometry 52 (1995) 25-29.

    Article  MathSciNet  MATH  Google Scholar 

  3. L. Danzer, B. Grünbaum, V. Klee, Helly’s theorem and its relatives, Convexity (Seattle, 1961) 101-179, Proc. Pure Math. Vol VII A.M.S., Providence, R.I., 1963.

    Google Scholar 

  4. P. Erdös, Some more problems on elementary geometry, Austr. Math. Soc. Gaz. 5 (1978) 52-54.

    MATH  Google Scholar 

  5. P. Erdös, G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935) 463-470.

    MathSciNet  MATH  Google Scholar 

  6. P. Erdös, G. Szekeres, On some extremum problems in elementary geometry, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 3-4 (1961) 53-62.

    Google Scholar 

  7. P. Gruber, Your picture is everywhere, Rend. Sem. Mat. Messina II 14, 1 (1991) 123-128.

    Google Scholar 

  8. S. Johnson, A new proof of the Erdös-Szekeres convex k-gon result, J. Comb. Theory A 42 (1986) 318-319.

    Article  MATH  Google Scholar 

  9. G. K¨¢rolyi, Ramsey-remainder for convex sets and the Erdös-Szekeres theorem, Discr. Appl. Math., to appear.

    Google Scholar 

  10. G. K¨¢rolyi, P. Valtr, Sets in Rd without large convex subsets, to appear.

    Google Scholar 

  11. W. Morris, V. Soltan, The Erdös-Szekeres problem on points in convex position ¨C a survey, Bull. Amer. Math. Soc. 37, 4, (2000) 437-458.

    MathSciNet  MATH  Google Scholar 

  12. T. S. Motzkin, Cooperative classes of finite sets in one and more dimensions, J. Comb. Theory 3 (1967) 244-251.

    Article  MathSciNet  MATH  Google Scholar 

  13. P. Valtr, Sets in Rd with no large empty convex subsets, Discrete Math. 108 (1992) 115-124.

    Article  MathSciNet  MATH  Google Scholar 

  14. P. Valtr, Several results related to the Erdös-Szekeres theorem, Dissertation, Charles University, Prague, 1996.

    Google Scholar 

  15. J. A. Wieacker, The convex hull of a typical compact set, Math. Ann. 282 (1988) 637-644.

    Article  MathSciNet  MATH  Google Scholar 

  16. T. Zamfirescu, The strange aspect of most compacta, to appear. A Version of Erdös’ Empty Polygon Problem 853

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Universität Dortmund, 44221, Dortmund, Germany

    Tudor Zamfirescu

Authors
  1. Tudor Zamfirescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, Polytechnic University, Six Metro Tech Center, Brooklyn, NY, 11201, USA

    Boris Aronov

  2. School of Mathematics, Georgia Institute of Technology, Atlanta, GA, 30332-0160, USA

    Saugata Basu

  3. City College and Courant Institute, 251 Mercer St., New York, NY, 10012, USA

    János Pach

  4. School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel

    Micha Sharir

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zamfirescu, T. (2003). Qualitative Infinite Version of Erdős’ Problem About Empty Polygons. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds) Discrete and Computational Geometry. Algorithms and Combinatorics, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55566-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55566-4_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62442-1

  • Online ISBN: 978-3-642-55566-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation