On the crossing number of K m,n

The best lower bound known on the crossing number of the complete bipartite graph is : In this paper we prove that: for su#ciently large m and n