Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
From MaRDI portal
Publication:2427899
DOI10.1016/j.laa.2011.09.027zbMath1244.15027arXiv1007.3807WikidataQ112882186 ScholiaQ112882186MaRDI QIDQ2427899
Publication date: 19 April 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3807
Schur complement; finite field; matroid; rank-width; well-quasi-order; rank decomposition; Lagrangian chain group
15B33: Matrices over special rings (quaternions, finite fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15B57: Hermitian, skew-Hermitian, and related matrices
05B35: Combinatorial aspects of matroids and geometric lattices
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs, Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions, Rank-width: algorithmic and structural results, The nullity theorem for principal pivot transform, Ribbon graphs and bialgebra of Lagrangian subspaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- A Menger-like property of tree-width: The finite case
- Isotropic systems
- A simple theorem on 3-connectivity
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Graph minors. X: Obstructions to tree-decomposition
- Branch-width and well-quasi-ordering in matroids and graphs.
- Principal pivot transforms: Properties and applications
- Approximating clique-width and branch-width
- Graph minors. IV: Tree-width and well-quasi-ordering
- A Class Of Abelian Groups
- Rank-Width and Well-Quasi-Ordering
- Greedy algorithm and symmetric matroids
- Lectures on matroids
- Menger's theorem for matroids
