Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by the difference between the number of red points and blue points is δ. We show that every set S as above has at least r balanced lines. The main techniques in the proof are rotations and a generalization, sliding rotations, introduced here
Given a set S of n points in the plane, a radial ordering of S with respect to a point p (not in S) ...
According to the Erdős–Szekeres theorem, for every n, a sufficiently large set of points in general ...
Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we give a nece...
Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S ...
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set i...
Abstract. Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we g...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
Let P be a set of n points in general position in the plane which is partitioned into color classes....
AbstractA radial point for a finite set P in the plane is a pointq≠∈P with the property that each li...
We consider an Erdős type question on k-holes (empty k-gons) in bichromatic point sets. For a bichr...
Let A be a reduced incidence relation between n lines and m points. Suppose that Through each two po...
Given a set S of n points in the plane, a radial ordering of S with respect to a point p (not in S) ...
According to the Erdős–Szekeres theorem, for every n, a sufficiently large set of points in general ...
Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we give a nece...
Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S ...
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set i...
Abstract. Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we g...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
AbstractLower bounds are given for the number of lines blocked by a set of q + 2 points in a project...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
Let P be a set of n points in general position in the plane which is partitioned into color classes....
AbstractA radial point for a finite set P in the plane is a pointq≠∈P with the property that each li...
We consider an Erdős type question on k-holes (empty k-gons) in bichromatic point sets. For a bichr...
Let A be a reduced incidence relation between n lines and m points. Suppose that Through each two po...
Given a set S of n points in the plane, a radial ordering of S with respect to a point p (not in S) ...
According to the Erdős–Szekeres theorem, for every n, a sufficiently large set of points in general ...
Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we give a nece...