Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics

Details Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics

2000-09-28

arxiv.org/abs/cs/0009028v1

Discrete Mathematics. 262(1-3):59-77. 2003

Computer Science

Discrete Mathematics

13 Pages

Scientific paper

10.1016/S0012-365X(02)00491-0

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersect in a point unless that point is an endpoint of all three. The rectilinear crossing number of K_n is the fewest number of edge crossings attainable over all rectilinear drawings of K_n. For each n we construct a rectilinear drawing of K_n that has the fewest number of edge crossings and the best asymptotics known to date. Moreover, we give some alternative infinite families of drawings of K_n with good asymptotics. Finally, we mention some old and new open problems.

Affiliated with

Also associated with

No associations

Rating

Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-651381