Computer Solution to the 17-point Erdős-szekeres Problem

@inproceedings{SzekeresComputerST,
  title={Computer Solution to the 17-point Erdős-szekeres Problem},
  author={George Szekeres and L L Peters}
}
We describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now commonly known as the “Happy End Problem”) that a planar configuration of 17 points, no 3 points collinear, always contains a convex 6-subset. The proof makes use of a combinatorial model of planar configurations, expressed in terms of signature functions satisfying certain simple necessary conditions. The proof is more general than the original conjecture as the signature… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Forced Convex n -Gons in the Plane

Discrete & Computational Geometry • 1998
View 4 Excerpts
Highly Influenced

A combinatorial problem on convex regions

J. D. Kalbfleisch, J. G. Kalbfleisch, R. G. Stanton
Proc. Louisiana Conf. on Combinatorics, Graph Theory and Computing , • 1970
View 5 Excerpts
Highly Influenced

A combinatorial problem in geometry

P. Erd̋os, G. Szekeres
1935
View 4 Excerpts
Highly Influenced

The Erd̋ os-Szekeres problem on points in convex position

W. Morris, V. Soltan
A survey”, Bull. Amer. Math. Soc. (N.S.) • 2000
View 2 Excerpts

Bonnice, “On convex polygons determined by a finite planar set

W E.
Amer. Math • 1974
View 2 Excerpts

On convex polygons determined by a finite planar set ”

R. L. Graham
Amer . Math . Monthly • 1974

Similar Papers

Loading similar papers…