Add to ORKGWe consider a variant of a question of Erdős on the number of empty k-gons (k-holes) in a set of n points in the plane, where we allow the k-gons to be non-convex. We show bounds and structural results on maximizing and minimizing the number of general 4-holes, and maximizing the number of non-convex 4-holes. In particular, we show that for n ≥ 9, the maximum number of general 4-holes is
We consider an Erdős type question on k-holes (empty k-gons) in bichromatic point sets. For a bichr...
Let P-n be a set of n points on the plane in general position, n >= 4. A convex quadrangulation of P...
AbstractLet P be a set of n points in the plane, no three collinear. A convex polygon of P is called...
We consider a variant of a question of Erdos on the number of empty k-gons (k-holes) in a set of n p...
We consider a variation of the classical Erdos-Szekeres problems on the existence and number of conv...
Counting interior-disjoint empty convex polygons in a point set is a typical Erdős-Szekeres-type pro...
Let P be a set of n points in the plane in general position. A subset H of P consisting of k element...
Let S be a set of n points in the general position, that is, no three points in S are collinear. A s...
Let P be a set of n points in the plane in general position. A subset H of P consisting of k element...
Let S be a set of n points in the plane in general position, that is, no three points of S are on a ...
Let S be a set of n points distributed uniformly and independently in a convex, bounded set in the p...
Let H(k; l), k ≤ l denote the smallest integer such that any set of H(k; l) points in the plane, no ...
AbstractLet P be a set of n points in general position in the plane. Let Xk(P) denote the number of ...
Let P be a set of n points in general position in the plane. Let Xk(P) denote the number of empty co...
AbstractLet P be a set of n points in the plane, no three collinear. A convex polygon of P is called...
We consider an Erdős type question on k-holes (empty k-gons) in bichromatic point sets. For a bichr...
Let P-n be a set of n points on the plane in general position, n >= 4. A convex quadrangulation of P...
AbstractLet P be a set of n points in the plane, no three collinear. A convex polygon of P is called...
We consider a variant of a question of Erdos on the number of empty k-gons (k-holes) in a set of n p...
We consider a variation of the classical Erdos-Szekeres problems on the existence and number of conv...
Counting interior-disjoint empty convex polygons in a point set is a typical Erdős-Szekeres-type pro...
Let P be a set of n points in the plane in general position. A subset H of P consisting of k element...
Let S be a set of n points in the general position, that is, no three points in S are collinear. A s...
Let P be a set of n points in the plane in general position. A subset H of P consisting of k element...
Let S be a set of n points in the plane in general position, that is, no three points of S are on a ...
Let S be a set of n points distributed uniformly and independently in a convex, bounded set in the p...
Let H(k; l), k ≤ l denote the smallest integer such that any set of H(k; l) points in the plane, no ...
AbstractLet P be a set of n points in general position in the plane. Let Xk(P) denote the number of ...
Let P be a set of n points in general position in the plane. Let Xk(P) denote the number of empty co...
AbstractLet P be a set of n points in the plane, no three collinear. A convex polygon of P is called...
We consider an Erdős type question on k-holes (empty k-gons) in bichromatic point sets. For a bichr...
Let P-n be a set of n points on the plane in general position, n >= 4. A convex quadrangulation of P...
AbstractLet P be a set of n points in the plane, no three collinear. A convex polygon of P is called...