一种求解与路径的笛卡尔积的交叉数的系统性方法
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
AI总结:
针对小图与长路径笛卡尔积交叉数研究依赖特设论证、适用范围窄的问题,提出通用下界构建方法,经133个5-6阶图测试,128例有效,含60个此前未明确或缺乏评审的案例。
摘要:
自20世纪70年代以来,确定小图与任意长路径的笛卡尔积的交叉数一直是一个持续研究的课题。这项工作需要建立一致的上界和下界:上界通常通过给出合适的绘图流程来证明,而下界往往需要大量的理论论证。目前已有许多相关论文发表,但它们通常每次仅关注一到两个小图,且使用针对这些图的特设论证。我们提出了一种通用方法,该方法在可行时能建立所需的下界。该方法可应用于任意图与任意长路径的笛卡尔积,且在每种情形下都需要求解有限个(通常仅两到三个)小图上的交叉数问题的改进版本。我们通过将该方法应用于涉及所有133个阶数为5或6的图$G$的笛卡尔积,验证了其有效性,结果表明该方法在128个案例中均可行。这其中包括60个在近期综述中被列为尚未确定,或仅在未经充分同行评审的期刊中被确定的案例。
英文摘要:
Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former is usually demonstrated by providing a suitable drawing procedure, while the latter often requires substantial theoretical arguments. Many such papers have been published, which typically focus on just one or two small graphs at a time, and use ad hoc arguments specific to those graphs. We propose a general approach which, when successful, establishes the required lower bound. This approach can be applied to the Cartesian product of any graph with arbitrarily large paths, and in each case involves solving a modified version of the crossing number problem on a finite number (typically only two or three) of small graphs. We demonstrate the potency of this approach by applying it to Cartesian products involving all 133 graphs $G$ of orders five or six, and show that it is successful in 128 cases. This includes 60 cases which a recent survey listed as either undetermined, or determined only in journals without adequate peer review.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。