...
首页> 外文期刊>Journal of Combinatorial Theory, Series B >Drawings of C_m * C_n with One Disjoint Family II
【24h】

Drawings of C_m * C_n with One Disjoint Family II

机译:具有一个不连续族II的C_m * C_n的图形

获取原文
获取原文并翻译 | 示例
           

摘要

A long-standing conjecture states that the crossing number of the Cartesian product of cycles C_m * C_n is (m-2) n, for every m,n satisfying n≥m≥3. A crossing is proper if it occurs between edges in different principal cycles. In this paper drawings of C_m * C_n with the principal n-cycles pairwise disjoint or the principal m-cycles pairwise disjoint are analyzed, and it is proved that every such drawing has at least (m-2) n proper crossings. As an application of this result, we prove that the crossing number of C_m * C_n is at least (m-2)n/2, for all integers m,n such that n≥m≥4. This is the best general lower bound known for the crossing number of C_m * C_n.
机译:一个长期的猜想指出,对于每一个满足n≥m≥3的m,n,循环C_m * C_n的笛卡尔积的交叉数为(m-2)n。如果交叉发生在不同主周期的边之间,则该交叉是适当的。本文分析了具有n个主循环成对不相交或具有m个主循环成对不相交的C_m * C_n图形,并证明每个图形至少具有(m-2)n个自然交点。作为该结果的应用,我们证明对于所有整数m,n,C≥n≥m≥4,C_m * C_n的交叉数至少为(m-2)n / 2。这是已知的交叉数C_m * C_n的最佳一般下限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号