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

三次图的最小极大匹配

Minimum maximal matchings in cubic graphs

Wouter Cames van Batenburg

摘要:

证明了每一个顶点为$n$的连通三次图的最大匹配至多为$\frac{5}{12} n+ \frac{1}{2}$。这证实了Baste,Fürst,Henning,Mohr和Rautenbach(2019)关于正则图的猜想的立方情况。更一般地,我们证明了每个图的$n$顶点和$m$边和最大程度最多$3$有一个最大匹配的大小最多$\frac{4n-m}{6}+ \frac{1}{2}$。这些界限是通过图$K_{3,3}$获得的,但渐近地仍有改进的余地。此外,可以有效地找到所要求的最大匹配。作为推论,我们得到了连通三次图中最小最大匹配的一个$\left(\frac{25}{18} + O \left( \frac{1}{n}\right)\right) $ -近似算法。

英文摘要:

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, Fürst, Henning, Mohr and Rautenbach (2019) on regular graphs. More generally, we prove that every graph with $n$ vertices and $m$ edges and maximum degree at most $3$ has a maximal matching of size at most $\frac{4n-m}{6}+ \frac{1}{2}$. These bounds are attained by the graph $K_{3,3}$, but asymptotically there may still be some room for improvement. Moreover, the claimed maximal matchings can be found efficiently. As a corollary, we have a $\left(\frac{25}{18} + O \left( \frac{1}{n}\right)\right) $-approximation algorithm for minimum maximal matching in connected cubic graphs.

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

↑