DeepAI AI Chat
Log In Sign Up

Planar Point Sets Determine Many Pairwise Crossing Segments

by   János Pach, et al.

We show that any set of n points in general position in the plane determines n^1-o(1) pairwise crossing segments. The best previously known lower bound, Ω(√(n)), was proved more than 25 years ago by Aronov, Erdős, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.


page 1

page 2

page 3

page 4


On Crossing-Families in Planar Point Sets

A k-crossing family in a point set S in general position is a set of k s...

The Crossing Tverberg Theorem

Tverberg's theorem is one of the cornerstones of discrete geometry. It s...

Colored ray configurations

We study the cyclic color sequences induced at infinity by colored rays ...

On problems related to crossing families

Given a set of points in the plane, a crossing family is a collection of...

A new lower bound on the maximum number of plane graphs using production matrices

We use the concept of production matrices to show that there exist sets ...

Long Alternating Paths Exist

Let P be a set of 2n points in convex position, such that n points are c...

On the Longest Flip Sequence to Untangle Segments in the Plane

A set of segments in the plane may form a Euclidean TSP tour or a matchi...