Improved Bounds for the Crossing Number of the Mesh of Trees

Improved bounds for the crossing number of the mesh of trees graph, M n , are derived. In particular, we derive a new lower bound of 80 # which improves on the previous bound of Leighton [11] by a constant factor, and an upper bound of (log n-