AbstractLet S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Ω(m3/(n6log2n)) triangles of T. Eppstein [D. Eppstein, Improved bounds for intersecting triangles and halving planes, J. Combin. Theory Ser. A 62 (1993) 176–182] gave a proof of this claim, but there is a problem with his proof. Here we provide a correct proof by slightly modifying Eppstein's argument
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
We present new lower bounds on the number of straight-edge triangulations that every set of n points...
AbstractWe prove an exponential upper bound for the number f(m,n) of all maximal triangulations of t...
AbstractLet S be a set of n points in the plane, and let T be a set of m triangles with vertices in ...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
AbstractWe show that a set of n points in the plane determine O(n2 log n) triples that define the sa...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractThe study of extremal problems on triangle areas was initiated in a series of papers by Erdő...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
AbstractWe investigate the following question: ‘Given an intersecting multi-hypergraph on n points, ...
A celebrated result of Mantel shows that every graph on n vertices with [n²/4] + 1 edges must contai...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
We present new lower bounds on the number of straight-edge triangulations that every set of n points...
AbstractWe prove an exponential upper bound for the number f(m,n) of all maximal triangulations of t...
AbstractLet S be a set of n points in the plane, and let T be a set of m triangles with vertices in ...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
AbstractWe show that a set of n points in the plane determine O(n2 log n) triples that define the sa...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractThe study of extremal problems on triangle areas was initiated in a series of papers by Erdő...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
AbstractWe investigate the following question: ‘Given an intersecting multi-hypergraph on n points, ...
A celebrated result of Mantel shows that every graph on n vertices with [n²/4] + 1 edges must contai...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
We present new lower bounds on the number of straight-edge triangulations that every set of n points...
AbstractWe prove an exponential upper bound for the number f(m,n) of all maximal triangulations of t...