ON THE CROSSING NUMBER OF THE COMPLETE TRIPARTITE GRAPH K1,8,n

• 作 者: 黄元秋 赵霆雷
• 机 构: DepartmentofMathematics
• 出 处: 数学物理学报：A辑
• 发表日期: 2006年B12期
• 关键词: 图论 完备三重图 相交数 双向图 Graphs Drawing Crossing number Complete tripartite graph Comple
• 基金项目: This work is supported by the Key Project of the Education Department of Hunan Province of China （05A037） and by Scientific Research Fund of Hunan Provincial Education Department （06C515）.

<正>The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph Km,n (m≤n) is Z(m,n). where Z(m,n) = [m/2] [(m-1)/2] [n/2] [(n-1)/2](for and real number x, [x] denotes the maximal integer no more than