Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics (Q1868837): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0009028 / rank | |||
Normal rank | |||
Latest revision as of 23:36, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics |
scientific article |
Statements
Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics (English)
0 references
28 April 2003
0 references
A rectilinear drawing of a graph represents the vertices by points in the plane and edges by straight line segments. This paper examines rectilinear drawings of the complete graph that have the fewest possible number of crossing points. The authors give new drawings of the complete graph that have fewer edge crossings than previously known. They also give improved asymptotic results for the rectilinear crossing number.
0 references
crossing number
0 references
rectilinear
0 references
complete graph
0 references
