arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.01476cs.CG
收藏

$Θ_6$-图的最大匹配和最小阻塞集

Maximum Matchings and Minimum Blocking Sets in $Θ_6$-Graphs

Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw

摘要:

$Θ_6$-图图是重要的几何图,在无线传感器网络中有许多应用。它们等价于Delaunay图,其中空的等边三角形代替空的圆。我们调查的最大匹配在这些图的大小上的下界。最著名的下界是$n/3$,其中$n$是图的顶点数。Babu et al.(2014)证明了任何$Θ_6$-图都有(接近)完美匹配(标准Delaunay图也是如此)。虽然这个猜想仍然是开放的,我们提高了下限$(3n-8)/7$。我们还涉及到$Θ_6$-图的最大匹配的大小的最小大小的阻塞集。点集$P$上的$Θ_6$-图的每条边对应于一个空三角形,该三角形包含边的端点,但不包含$P$的其他点。一个阻塞集在每个这样的三角形中至少有一个点。我们证明了最大匹配的大小至少是$β(n)/2$,其中$β(n)$是最小的,在所有θ-6图与$n$顶点,一个最小的块集的大小。在另一个方向上,匹配的下界可以用来证明$β$上的界,这使我们能够证明$β(n)\geq 3n/4-2$。

英文摘要:

$Θ_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is $n/3$, where $n$ is the number of vertices of the graph. Babu et al. (2014) conjectured that any $Θ_6$-graph has a (near-)perfect matching (as is true for standard Delaunay graphs). Although this conjecture remains open, we improve the lower bound to $(3n-8)/7$. We also relate the size of maximum matchings in $Θ_6$-graphs to the minimum size of a blocking set. Every edge of a $Θ_6$-graph on point set $P$ corresponds to an empty triangle that contains the endpoints of the edge but no other point of $P$. A blocking set has at least one point in each such triangle. We prove that the size of a maximum matching is at least $β(n)/2$ where $β(n)$ is the minimum, over all theta-six graphs with $n$ vertices, of the minimum size of a blocking set. In the other direction, lower bounds on matchings can be used to prove bounds on $β$, allowing us to show that $β(n)\geq 3n/4-2$.

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

↑