References
- ErdősP., SzekeresG., A combinatorial problem in geometry, Compos. Math., 2 1935 463–470
- ErdősP., SzekeresG., On some extremum problems in elementary geometry, Ann. Univ. Sci. Budapest, Eötvös, Sect, Math., 3/4 1960 53–62
- KalbfleishJ.D., KalbfleischJ.D., StantonR.G., A combinatorial problem on convex regions, Proc. La. Conf. Comb., Graph Theory Comput., Lousiana State Univ., 1 1970 180–188
- SzekeresG., PetersL., Computer solution to the 17-point Erdős-Szekeres problem, ANZIAM J., 48 2006 151–164
- TóthG., ValtrP., The Erdős-Szekeres theorem: Upper bounds and related results GoodmanJ.E., PachJ., WelzlE.Cominatorial and Computational Geometry, vol. 522005557–568
- BárányI., KárolyiGy., Problems and results around the Erdős–Szekeres convex polygon theorem AkiyamaJ., KanoM., UrabeM.Discrete and Computational Geometry, Japanese Conference, JCDCG 2000 Lecture Notes in Computer Science, vol. 2098 2001Springer91–105
- MorrisW., SoltanV., The Erdős–Szekeres problem on points in convex position–A survey, Bull. Amer. Math. Soc., 3742000 437–458
- Erdos̋P., Some combinatorial problems in geometry Proceedings Conference University Haifa Lecture Notes in Mathematics, vol. 792 1979 46–53
- HarborthH., Konvexe fünfecke in ebenen Punktmengen, Elem. Math., 33 1978 116–118
- HortonJ., Sets with no empty 7-gons, Canad. Math. Bull., 26 1983 482–484
- OvermarsM.H., Finding sets of points without empty convex 6-gons, Discrete Comput. Geom., 29 2003 153–158
- GerkenT., Empty convex hexagons in planar point sets, Discrete Comput. Geom., 39 2008 239–272
- NicolásC.M., The empty hexagon theorem, Discrete Comput. Geom., 38 2007 389–397
- ValtrP., On empty hexagons GoodmanJ.E., PachJ., PollackR.Surveys on Discrete and Computational Geometry, Twenty Years Later2008AMS433–441
- KoshelevV.A., On Erdős-Szekeres problem for empty hexagons in the plane, Model. Anal. Iform. Sist., 1622009 22–74
- UrabeM., On a partition into convex polygonss, Discrete Appl. Math., 64 1996 179–191
- HosonoK., UrabeM., On the number of disjoint convex quadrilaterals for a plannar point set, Comput. Geom., Theory Appl., 20 2001 97–104
- HosonoK., UrabeM., On the minimum size of a point set containing two non-intersecting empty convex polygons AkiyamaJ., KanoM., TanX.Discrete and Computational Geometry, Japanese Conference, JCDCG 2004 Lecture Notes in Computer Science, vol. 3742 2005 117–122
- HosonoK., UrabeM., A minimal planar point set with specified disjoint empty convex subsets ItoH., KanoM., KatohN., UnoY.Computational Geometry and Graph Theory, International Conference, KyotoCGGT 2007 Lecture Notes in Computer Science, vol. 4535 2008 90–100
- BhattacharyaB.B., DasS., On the minimum size of a point set containing a 5-hole and a disjoint 4-hole, Stud. Sci. Math. Hung., 48 2011 445–457
- BhattacharyaB.B., DasS., Disjoint empty convex pentagons in planar point sets, Period. Math. Hungar., 66 2013 73–86
- M. Lomeli-Haro, T. Sakai, J. Urrutia, Convex quadrilaterals of point sets with disjoint interiors, in: The Collection of Extended Abstracts, in: Computational Geometry and Graph Theory, International Conference, KyotoCGGT 2007.