Geodesic
The rectilinear crossing number of \(K_{10}\) is 62
The electronic journal of combinatorics, Tome 8 (2001) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1567
Classification : 05C10
Mots-clés : rectilinear crossing number, drawing 
@article{10_37236_1567,
     author = {Alex Brodsky and Stephane Durocher and Ellen Gethner},
     title = {The rectilinear crossing number of {\(K_{10}\)} is 62},
     journal = {The electronic journal of combinatorics},
     year = {2001},
     volume = {8},
     number = {1},
     doi = {10.37236/1567},
     zbl = {0965.05038},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1567/}
}
TY  - JOUR
AU  - Alex Brodsky
AU  - Stephane Durocher
AU  - Ellen Gethner
TI  - The rectilinear crossing number of \(K_{10}\) is 62
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1567/
DO  - 10.37236/1567
ID  - 10_37236_1567
ER  - 
%0 Journal Article
%A Alex Brodsky
%A Stephane Durocher
%A Ellen Gethner
%T The rectilinear crossing number of \(K_{10}\) is 62
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1567/
%R 10.37236/1567
%F 10_37236_1567
Alex Brodsky; Stephane Durocher; Ellen Gethner. The rectilinear crossing number of \(K_{10}\) is 62. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1567

Cité par Sources :