The Optimal Drawings of $K_{5,n}$

[摘要] Zarankiewicz's Conjecture (ZC) states that the crossing number cr$(K_{m,n})$ equals $Z(m,n):=\lfloor{\frac{m}{2}}\rfloor \lfloor{\frac{m-1}{2}}\rfloor  \lfloor{\frac{n}{2}}\rfloor \lfloor{\frac{n-1}{2}}\rfloor$. Since Kleitman's verification of ZC for $K_

[学科分类] 离散数学和组合数学

[关键词] Crossing numbers;complete bipartite graphs;Zarankiewicz Conjecture