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

可平面图模式的低次多项式排除

Low Polynomial Exclusion of Planar Graph Patterns

Jean-Florent Raymond, Dimitrios M. Thilikos

摘要:

著名的网格排除定理指出,对于每个$h$ -顶点可平面图$H$,有一个常数$c_{h}$,使得如果图$G$不包含$H$作为子图,则$G$最多有$c_{h}$树宽。我们正在寻找模式的$H$,这个界限可以成为一个低次多项式。我们提供了这样的界限以下参数化图:车轮($c_{h}=O(h)$),双轮($c_{h}=O(h^2\cdot \log^{2} h)$),任何图的路径宽度至多为2($c_{h}=O(h^{2})$),和蒙古包图($c_{h}=O(h^{4})$)。

英文摘要:

The celebrated grid exclusion theorem states that for every $h$-vertex planar graph $H$, there is a constant $c_{h}$ such that if a graph $G$ does not contain $H$ as a minor then $G$ has treewidth at most $c_{h}$. We are looking for patterns of $H$ where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel ($c_{h}=O(h)$), the double wheel ($c_{h}=O(h^2\cdot \log^{2} h)$), any graph of pathwidth at most 2 ($c_{h}=O(h^{2})$), and the yurt graph ($c_{h}=O(h^{4})$).

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

↑