Computer solution to the 17-point Erdos-Szekeres problem

ANZIAM Journal

Volumn 48, Issue 2, 2006, Pages 151-164

  Szekeres, George ^a   Peters, Lindsay ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b Pacific Knowledge Systems   (Australia)

Author keywords

Convex polygons and polyhedra; Erdos Szekeres problem; Generalized convexity; Ramsey theory

Indexed keywords

EID: 33847090749     PISSN: 14461811     EISSN: None     Source Type: Journal    
DOI: 10.1017/s144618110000300x     Document Type: Article

References (9)

1. W. E. Bonnice, "On convex polygons determined by a finite planar set", Amer. Math. Monthly 81 (1974) 749-752.
2. F. R. K. Chung and R. L. Graham, "Forced convex n-gons in the plane", Discrete Comput. Geom. 19 (1998) 367-371, Special Issue.
3. P. Erdos and G. Szekeres, "A combinatorial problem in geometry", Compositio Math. 2 (1935) 463-470.
4. P. Erdos and G. Szekeres, "On some extremum problems in elementary geometry", Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 3-4 (1961) 53-63.
5. J. D. Kalbfleisch, J. G. Kalbfleisch and R. G. Stanton, "A combinatorial problem on convex regions", in 1970 Proc. Louisiana Conf. on Combinatorics, Graph Theory and Computing, (Louisiana State Univ., Baton Rouge, 1970) 180-188.
6. D. E. Knuth, Axioms and Hulls (Springer, Heidelberg, 1992).
7. W. Morris and V. Soltan, "The Erdos-Szekeres problem on points in convex position. A survey", Bull. Amer. Math. Soc. (N.S.) 37 (2000) 437-458.
8. G. Toth and P. Valtr, "The Erdos-Szekeres theorem: upper bounds and related results", in Combinatorial and computational geometry, Math. Sci. Res. Inst. Publ. 52, (Cambridge Univ. Press, Cambridge, 2005) 557-568.
9. R. M. Wilson and J. H. van Lint, A Course in Combinatorics (Cambridge Univ. Press, New York, 1992).