On k-Gons and k-Holes in Point Sets

We consider a variation of the classical Erd?s-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show bounds and structural results on maximizing and minimizing their numbers. Most noteworthy, for any k and sufficiently large n, we give a quadratic lower bound for the number of k-holes, and show that this number is maximized by sets in convex position.

[1]  R. Pollack,et al.  Surveys on discrete and computational geometry : twenty years later : AMS-IMS-SIAM Joint Summer Research Conference, June 18-22, 2006, Snowbird, Utah , 2008 .

[2]  Esther E. Klein,et al.  On some extremum problems in elementary geometry , 2006 .

[3]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[4]  Oswin Aichholzer,et al.  The point set order type data base: A collection of applications and results , 2001, CCCG.

[5]  Carlos M. Nicolas.  The Empty Hexagon Theorem , 2007, Discret. Comput. Geom..

[6]  Adrian Dumitrescu.  Planar sets with few empty convex polygons , 1998, CCCG.

[7]  Alexander Pilz,et al.  Lower Bounds for the Number of Small Convex k-Holes , 2014, CCCG.

[8]  Heiko Harborth.  Konvexe Fünfecke in ebenen Punktmengen. , 1978 .

[9]  Ruy Fabila Monroy,et al.  Covering Islands in Plane Point Sets , 2011, EGC.

[10]  G. Tóth,et al.  The Erdős – Szekeres Theorem : Upper Bounds and Related Results , 2004 .

[11]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[12]  Jesús Leaños,et al.  A central approach to bound the number of crossings in a generalized configuration , 2008, Electron. Notes Discret. Math..

[13]  Paul Erdös,et al.  Some Old and New Problems in Combinatorial Geometry , 1984 .

[14]  P. Erdös,et al.  Crossing Number Problems , 1973 .

[15]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[16]  J. D. Loera,et al.  Triangulations: Structures for Algorithms and Applications , 2010 .

[17]  V. A. Koshelev.  On the Erdös-Szekeres problem , 2007 .

[18]  Eric W. Weisstein.  Rectilinear Crossing Number , 1999 .

[19]  Jeffrey Shallit,et al.  Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.

[20]  I. Bárány,et al.  Empty Simplices in Euclidean Space , 1987, Canadian Mathematical Bulletin.

[21]  Csaba D. Tóth,et al.  Bounds on the Maximum Multiplicity of Some Common Geometric Graphs , 2013, SIAM J. Discret. Math..

[22]  Tobias Gerken.  Empty Convex Hexagons in Planar Point Sets , 2008, Discret. Comput. Geom..

[23]  Alfredo Garcia.  A Note on the Number of Empty Triangles , 2011, EGC.

[24]  George Szekeres,et al.  Computer solution to the 17-point Erdős-Szekeres problem , 2006 .

[25]  Pavel Valtr.  Convex independent sets and 7-holes in restricted planar point sets , 1992, Discret. Comput. Geom..

[26]  G. Fejes Tóth.  PLANAR POINT SETS WITH A SMALL NUMBER OF EMPTY CONVEX POLYGONS , 2004 .

[27]  P. Valtr.  On the minimum number of empty polygons in planar point sets , 1992 .

[28]  Oswin Aichholzer,et al.  On 5-Gons and 5-Holes , 2011, EGC.

[29]  Micha Sharir,et al.  Counting Triangulations of Planar Point Sets , 2009, Electron. J. Comb..

[30]  Pavel Valtr.  On empty pentagons and hexagons in planar point sets , 2012, CATS.

[31]  Marc Noy,et al.  Lower bounds on the number of crossing-free subgraphs of KN , 2000, Comput. Geom..

[32]  Géza Tóth,et al.  The Erdo"s-Szekeres Theorem: upper Bounds and Related Results , 2007 .

[33]  Micha Sharir,et al.  Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique , 2013, J. Comb. Theory, Ser. A.

[34]  Csaba D. Tóth,et al.  Bounds on the maximum multiplicity of some common geometric graphs , 2011, STACS.

[35]  Micha Sharir,et al.  On empty convex polygons in a planar point set , 2004, SCG '04.

[36]  Knut Dehnhardt.  Leere konvexe Vielecke in ebenen Punktmengen , 1987 .

[37]  Oswin Aichholzer.  Empty ] [ colored ] k-gons-Recent results on some Erdős-Szekeres type problems , 2009 .

[38]  Birgit Vogtenhuber,et al.  Combinatorial Aspects of [Colored] Point Sets in the Plane , 2011 .

[39]  J. Horton.  Sets with No Empty Convex 7-Gons , 1983, Canadian Mathematical Bulletin.

[40]  Jesús Leaños,et al.  On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn , 2011, Discret. Comput. Geom..