An improved upper bound on the crossing number of the hypercube
Luérbio Faria, Celina M.H. de Figueiredo, Ondřej Sýkora, Imrich Vrt’o · Journal of Graph Theory · 2008
Abstract We draw the n‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 145–161, 2008