The rectilinear crossing number of \(K_{10}\) is 62 (Q5934081): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0009023 / rank | |||
Normal rank | |||
Latest revision as of 11:09, 18 April 2024
scientific article; zbMATH DE number 1605744
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The rectilinear crossing number of \(K_{10}\) is 62 |
scientific article; zbMATH DE number 1605744 |
Statements
The rectilinear crossing number of \(K_{10}\) is 62 (English)
0 references
18 June 2001
0 references
Summary: The rectilinear crossing number of a graph \(G\) is the minimum number of edge crossings that can occur in any drawing of \(G\) in which the edges are straight line segments and no three vertices are collinear. This number has been known for \(G=K_n\) if \(n \leq 9\). Using a combinatorial argument we show that for \(n=10\) the number is 62.
0 references
rectilinear crossing number
0 references
drawing
0 references
