Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics (Q1868837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1901889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics |
scientific article; zbMATH DE number 1901889 |
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
0.8881503939628601
0 references
0.8733585476875305
0 references
0.8672727346420288
0 references
