Home ยป The Crossing Number of the Complete Graph

This is not the best known bound.

On July 28th, 2008 Anonymous says:

The same article below, that proves that $ cr(K_{11})=100 $ and $ cr(K_{12})=150 $, states that $ 0.8594 \cdot Z(n)\leq cr(K_n) \leq Z(n) $.

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options