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.
Warsaw University of Technology(华沙理工大学);University of Warsaw(华沙大学);FAMNIT and IAM, University of Primorska(普里莫斯卡大学 FAMNIT 与 IAM);IT University of Copenhagen(哥本哈根信息技术大学)
在[有向树宽度]中,J. Combin. Theory Ser. B 82(2001),138-154]我们引入了有向图树宽的概念,并提出了一个猜想,在与Noga Alon和Bruce Reed的讨论中提出,一个巨大树宽的有向图有一个大的“圆柱形网格”子图。在这里,我们证明了平面有向图的猜想,但许多步骤的证明工作一般。这是一份2001年10月未经编辑和打磨的手稿。由于许多人要求提供副本,我们正在提供,希望它可能有用。Kawarabayashi和Kreutzer在arXiv:1411.5681中证明了这个猜想。
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
CNRS, Lyon, France(法国里昂国家科学研究中心);Department of Mathematics, Hanyang University, and Discrete Mathematics Group, Institute for Basic Science (IBS), South Korea(韩国汉阳大学数学系及基础科学研究院离散数学组);School of Mathematics, Monash University, Melbourne, Australia(澳大利亚墨尔本蒙纳士大学数学学院)
School of Computing, KAIST(韩国科学技术院);School of Mathematics, Monash University(蒙纳士大学);Discrete Mathematics Group, Institute for Basic Science (IBS)(基础科学研究院);Department of Mathematical Sciences, KAIST(韩国科学技术院数学科学系)
本文证明了一个连通图的线性秩宽为1当且仅当它是一个距离遗传图且它的分裂分解树是一条路.一个直接的结果是,我们可以在线性时间内判定一个图的线性秩宽是否至多为1,如果不是,则给出一个障碍.其他直接的结果是线性秩宽为1的图的几个特征。特别地,一个连通图具有线性秩宽1当且仅当它局部等价于一个毛毛虫当且仅当它是一条路的顶点子图[O-juanKwon and Sang-il Oum,Graphs of small rank-width are approximates-minor of graphs of small tree-width,arxiv:1203.3606]当且仅当它不包含co-K_2图、Net图和5-圈图作为顶点子图[Isolde Adler,Arthur M. Farley和Andrzej Proskurowski,线性秩宽度至多为1的障碍,arxiv:1106.2533]。
Excluded vertex-minors for graphs of linear rank-width at most k
线性秩宽是一个图的宽度参数,它是通过将其树限制为毛毛虫而得到的秩宽的变化。作为已知定理的推论,对于每个$k$,存在图的有限阻塞集$\mathcal{O}_k$,使得图$G$具有至多$k$的线性秩宽度当且仅当$G$的顶点子式与$\mathcal{O}_k$中的图不同构。然而,尚未尝试为$k\ge 2$限制$\mathcal{O}_k$中的图形数量。我们证明了对于每个$k$,在$\mathcal{O}_k$中至少存在$2^{Ω(3^k)}$两两局部非等价图,因此在$\mathcal{O}_k$中的图数至少是双指数的.为了证明这一定理,需要刻画$\mathcal O_k$中的两个图何时局部等价。一个图是块图,如果它的所有块是完全图。证明了如果两个块图的单纯顶点的度至少为$2$,则它们是局部等价的。这不仅对我们的定理有用,而且还隐含了Bouchet的定理[Transforming trees by successful local complementations,J.图论12(1988),no. 2,195-207],该定理指出,如果两棵树是局部等价的,则它们是同构的。
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs
在[Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices,arXiv:1007.3807v1]中,Oum证明了,对于一个固定的有限域$\mathbf{F}$,在有界$\mathbf{F}$ -rank-width的$\mathbf{F}$上的(反)对称矩阵的任何无限序列$M_1,M_2,...$都有一对$i< j$,使得$M_i$同构于$M_j$的主枢轴变换的主子矩阵。我们将这个结果推广到Rao和我在[边着色图的秩宽度,arXiv:0709.1433v4]中介绍的$σ$对称矩阵。(斜)对称矩阵是PDMATHAMR-对称矩阵的特殊情况。作为一个副产品,我们得到,对于每一个无限序列$G_1,G_2,...$的有界秩宽度的有向图,存在一对$i<j$,使得$G_i$是一个非子式$G_j$。另一个推论是,PDMATHAMR对称矩阵的非奇异主子矩阵形成δ拟阵。我们以这种方式扩展了Bouchet的Delta拟阵可表示性的概念。
École Normale Supérieure, Paris(巴黎高等师范学院);KAIST, Daejeon(韩国科学技术院);CNRS, Paris(法国国家科学研究中心);Centre d’Analyse et de Mathématiques Sociales (CNRS, UMR 8557), Paris(社会分析与数学中心);Computer Science Institute of Charles University, Praha(布拉格查理大学计算机研究所)