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

树子式与线性秩宽

Tree pivot-minors and linear rank-width

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

摘要:

树宽及其线性变径径宽对图的子式关系起着核心作用。特别地,Robertson和Seymour(1983)证明了对于每一棵树~$T$,不包含$T$作为子图的图类具有有界路宽。对于非子式关系,秩宽度和线性秩宽度取代了树宽度和路径宽度的作用。因此,很自然地要检查是否对于每棵树~$T$,不包含$T$作为子图的图类具有有界线性秩宽度。我们首先证明,这个说法是假的,只要$T$是一棵树,是不是毛毛虫。我们猜想,如果$T$是一个毛毛虫,这个陈述是正确的。我们还证明了:(1)对于每棵树$T$,$T$-无子图距离遗传图类具有有界线性秩宽当且仅当$T$是毛毛虫;(2)对于每棵至多四个顶点上的毛毛虫$T$,$T$-无子图距离遗传图类具有有界线性秩宽.为了证明我们的第二个结果,我们只需要考虑$T=P_4$和$T=K_{1,3}$,但我们遵循一个一般的策略:首先,我们证明了类$T$-无子图包含在某些类$(H_1,H_2)$-无图,我们然后证明了有界线性秩宽度。特别地,我们证明了无$(K_3,S_{1,2,2})$图类具有有界线性秩宽,从而加强了一个已知的结果,即无$(K_3,S_{1,2,2})$图类具有有界秩宽.

英文摘要:

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree~$T$, the class of graphs that do not contain $T$ as a minor has bounded path-width. For the pivot-minor relation, rank-width and linear rank-width take over the role from tree-width and path-width. As such, it is natural to examine if for every tree~$T$, the class of graphs that do not contain $T$ as a pivot-minor has bounded linear rank-width. We first prove that this statement is false whenever $T$ is a tree that is not a caterpillar. We conjecture that the statement is true if $T$ is a caterpillar. We are also able to give partial confirmation of this conjecture by proving: (1) for every tree $T$, the class of $T$-pivot-minor-free distance-hereditary graphs has bounded linear rank-width if and only if $T$ is a caterpillar; (2) for every caterpillar $T$ on at most four vertices, the class of $T$-pivot-minor-free graphs has bounded linear rank-width. To prove our second result, we only need to consider $T=P_4$ and $T=K_{1,3}$, but we follow a general strategy: first we show that the class of $T$-pivot-minor-free graphs is contained in some class of $(H_1,H_2)$-free graphs, which we then show to have bounded linear rank-width. In particular, we prove that the class of $(K_3,S_{1,2,2})$-free graphs has bounded linear rank-width, which strengthens a known result that this graph class has bounded rank-width.

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

↑