arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.04069math.CO
收藏

几乎完全图的三角剖分

Triangulating Almost-Complete Graphs

Kim Nguyen Pham, Landon Settle, Kayla Wright, Padraic Bartlett

摘要:

图$G$的三角形分解是将$G$的边划分成三角形。$G$允许这种分解的两个必要条件是$|E(G)|$是3的倍数,并且$G$中任何顶点的度是偶数;我们称这样的图为三分图。柯克曼的工作施泰纳三重系统建立,为$G \simeq K_n$,$G$承认一个三角形分解正是当$G$是tridivisible。在1970年,Nash-Williams证明了三分性对于“几乎完全”图也是足够的,为了这个演讲的目的,我们将其解释为任何在$n$顶点上的图$G$,其中$δ(G) \geq (1 -ε)n, E(G) \geq (1 - ξ)\binom{n}{2}$对于一些适当小的常数$ε, ξ$。纳什-威廉姆斯证明$ε= ξ=1/4$就足够了; 1991年,古斯塔夫松在他的论文中证明$ε= ξ< 10^{-24}$对所有$n \equiv 3, 9 \mod 18$都足够了,2015年,Keevash关于组合设计的存在性猜想的工作确定了$ε$的某些值对任何$n$都存在。在本文中,我们证明了,对于任何$ε< \frac{1}{432}$,有一个常数$ξ$,使任何$G$与$δ(G) \geq (1 - ε)n$和$|E(G)| \geq (1 - ξ)\binom{n}{2}$承认这样的分解,并提供了一个算法,显式构造这样的三角剖分。此外,我们注意到,我们的算法在多项式时间内运行在这样的图。(This最后一个观察与Holyer的结果形成对比,Holyer的结果是寻找三角形分解一般是NP完全问题。

英文摘要:

A triangle decomposition of a graph $G$ is a partition of the edges of $G$ into triangles. Two necessary conditions for $G$ to admit such a decomposition are that $|E(G)|$ is a multiple of three and that the degree of any vertex in $G$ is even; we call such graphs tridivisible. Kirkman's work on Steiner triple systems established that for $G \simeq K_n$, $G$ admits a triangle decomposition precisely when $G$ is tridivisible. In 1970, Nash-Williams conjectured that tridivisiblity is also sufficient for "almost-complete" graphs, which for this talk's purposes we interpret as any graph $G$ on $n$ vertices with $δ(G) \geq (1 -ε)n, E(G) \geq (1 - ξ)\binom{n}{2}$ for some appropriately small constants $ε, ξ$. Nash-Williams conjectured that $ε= ξ=1/4$ would suffice; in 1991, Gustavsson demonstrated in his dissertation that $ε= ξ< 10^{-24}$ suffices for all $n \equiv 3, 9 \mod 18$, and in 2015 Keevash's work on the existence conjecture for combinatorial designs established that some value of $ε$ existed for any $n$. In this paper, we prove that for any $ε< \frac{1}{432}$, there is a constant $ξ$ such that any $G$ with $δ(G) \geq (1 - ε)n$ and $|E(G)| \geq (1 - ξ)\binom{n}{2}$ admits such a decomposition, and offer an algorithm that explicitly constructs such a triangulation. Moreover, we note that our algorithm runs in polynomial time on such graphs. (This last observation contrasts with Holyer's result that finding triangle decompositions in general is a NP-complete problem.)

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

↑