arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.01729math.COcs.DM
收藏

使用整数规划构造极值无三角形图

Constructing extremal triangle-free graphs using integer programming

Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın

AI总结:

针对禁止子图影响极值图最大边数的问题,本文开发整数规划公式并结合Orbital Branching与可行域迭代限制方法,将无三角形极值图的求解范围扩展至d≤10,验证了相关边数公式猜想。

摘要:

匹配数为 m 且最大度为 d 的图中的最大边数已在 [1] 和 [2] 中被确定,其中也提供了一些极值图。随后出现了一个新问题:禁止在这些极值图中出现某些子图会如何影响最大边数?在 [3] 中,该问题在无三角形图中针对 $d \geq m$ 的情况,以及 $d < m$ 且 $Z(d) \leq m < 2d$ 或 $d \leq 6$ 的情况得到了解决,其中 $Z(d)$ 约为 $5d/4$。作者推导了无三角形极值图的结构性质,这使我们能够专注于构造小的极值分量来形成极值图。基于这些发现,在本文中,我们开发了一种用于构造极值图的整数规划公式。由于我们的公式高度对称,我们使用自己实现的 Orbital Branching 来减少对称性。我们还实现了我们的整数规划公式,使得可行域被迭代地限制。结合这两种方法,我们将针对 $m > d$ 的解扩展到了 $d \leq 10$,而不是 $d \leq 6$。我们的结果证实了 [3] 中猜想的所有极值无三角形图中边数的公式。

英文摘要:

The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a new question has emerged: how the maximum edge count is affected by forbidding some subgraphs occurring in these extremal graphs? In [3], the problem is solved in triangle-free graphs for $d \geq m$, and for $d < m$ with either $Z(d) \leq m < 2d$ or $d \leq 6$, where $Z(d)$ is approximately $5d/4$. The authors derived structural properties of triangle-free extremal graphs, which allows us to focus on constructing small extremal components to form an extremal graph. Based on these findings, in this paper, we develop an integer programming formulation for constructing extremal graphs. Since our formulation is highly symmetric, we use our own implementation of Orbital Branching to reduce symmetry. We also implement our integer programming formulation so that the feasible region is restricted iteratively. Using a combination of the two approaches, we expand the solution into $d \leq 10$ instead of $d \leq 6$ for $m > d$. Our results endorse the formula for the number of edges in all extremal triangle-free graphs conjectured in [3].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑