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

最大度为4的图的诱导匹配

Induced Matchings in Graphs of Maximum Degree 4

Felix Joos

摘要:

对于图$G$,设$ν_s(G)$是$G$的导出匹配数。我们证明了每一个图$G$的最大程度在最多$4$和没有孤立的顶点,不包含一定的炸毁$5$ -圈作为一个组件的尖锐界$ν_s(G)\geq \frac{n(G)}{9}$。这个结果暗示了著名的Erdens和Nešethabil猜想的一个结果,即图$G$的强色指数$χ_s'(G)$至多是$\frac{5}{4}Δ(G)^2$,因为有$ν_s(G)\geq \frac{m(G)}{χ_s'(G)}$和$n(G)\geq \frac{m(G)Δ(G)}{2}$ .此外,它表明,有多项式时间算法,计算诱导匹配的大小至少为$\frac{n(G)}{9}$。

英文摘要:

For a graph $G$, let $ν_s(G)$ be the induced matching number of $G$. We prove the sharp bound $ν_s(G)\geq \frac{n(G)}{9}$ for every graph $G$ of maximum degree at most $4$ and without isolated vertices that does not contain a certain blown up $5$-cycle as a component. This result implies a consequence of the well known conjecture of Erdős and Nešetřil, saying that the strong chromatic index $χ_s'(G)$ of a graph $G$ is at most $\frac{5}{4}Δ(G)^2$, because $ν_s(G)\geq \frac{m(G)}{χ_s'(G)}$ and $n(G)\geq \frac{m(G)Δ(G)}{2}$. Furthermore, it is shown that there is polynomial-time algorithm that computes induced matchings of size at least $\frac{n(G)}{9}$.

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

↑