arXiv Analytics

Sign in

arXiv:1102.2134 [math.CO]AbstractReferencesReviewsResources

Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs

Mamadou Moustapha Kanté

Published 2011-02-10, updated 2014-07-08Version 3

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of bounded $\mathbf{F}$-rank-width has a pair $i< j$, such that $M_i$ is isomorphic to a principal submatrix of a principal pivot transform of $M_j$. We generalise this result to $\sigma$-symmetric matrices introduced by Rao and myself in [The Rank-Width of Edge-Coloured Graphs, arXiv:0709.1433v4]. (Skew) symmetric matrices are special cases of $\sigma$-symmetric matrices. As a by-product, we obtain that for every infinite sequence $G_1,G_2,...$ of directed graphs of bounded rank-width there exist a pair $i<j$ such that $G_i$ is a pivot-minor of $G_j$. Another consequence is that non-singular principal submatrices of a $\sigma$-symmetric matrix form a delta-matroid. We extend in this way the notion of representability of delta-matroids by Bouchet.

Comments: 35 pages. Revised version with a section for directed graphs
Journal: European Journal of Combinatorics 33(8):1820--1841(2012)
Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:math/0602061 [math.CO] (Published 2006-02-03)
Spanning Forests of a Digraph and Their Applications
arXiv:1102.2950 [math.CO] (Published 2011-02-15)
Kron Reduction of Graphs with Applications to Electrical Networks
arXiv:1108.2871 [math.CO] (Published 2011-08-14, updated 2012-04-23)
A bound for the number of vertices of a polytope with applications