Rank connectivity and pivot-minors of graphs

DOI10.1016/J.EJC.2022.103634MaRDI QIDQ2107500zbMATH OpenOpenAlexFDO

Authors Sang-Il Oum

Publication date 1 December 2022

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.03205

zbMATH Keywords

\(k^{+\ell}\)-rank-connected graphcut-rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Abstract: The cut-rank of a set $X$ in a graph $G$ is the rank of the $Ximes(V(G)-X)$ submatrix of the adjacency matrix over the binary field. A split is a partition of the vertex set into two sets $(X,Y)$ such that the cut-rank of $X$ is less than $2$ and both $X$ and $Y$ have at least two vertices. A graph is prime (with respect to the split decomposition) if it is connected and has no splits. A graph $G$ is $k^{+ell}$-rank-connected if for every set $X$ of vertices with the cut-rank less than $k$, $lvertXvert$ or $lvertV(G)-Xvert$ is less than $k+ell$. We prove that every prime $3^{+2}$-rank-connected graph $G$ with at least $10$ vertices has a prime $3^{+3}$-rank-connected pivot-minor $H$ such that $lvertV(H)vert=lvertV(G)vert-1$. As a corollary, we show that every excluded pivot-minor for the class of graphs of rank-width at most $k$ has at most $(3.5cdot{6}^k-1)/5$ vertices for $kge2$. We also show that the excluded pivot-minors for the class of graphs of rank-width at most $2$ have at most $16$ vertices.

Recommendations

• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Tree pivot-minors and linear rank-width
• Computing small pivot-minors
• The average cut-rank of graphs
• Rank-width and vertex-minors

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• A Splitter Theorem for Internally 4‐Connected Binary Matroids
• A chain theorem for 4-connected matroids
• A decomposition theory for matroids. I: General results
• A simple theorem on 3-connectivity
• Approximating clique-width and branch-width
• Decomposition of Directed Graphs
• Generating weakly 4-connected matroids
• Graph minors. X: Obstructions to tree-decomposition
• Matrices and matroids for systems analysis
• Minimally 3-connected isotropic systems
• Prime Testing for the Split Decomposition of a Graph
• Rank-width and vertex-minors
• Rank-width: algorithmic and structural results
• Reducing prime graphs and recognizing circle graphs

Cited in

(11)

• Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)
• Intertwining Connectivities for Vertex-Minors and Pivot-Minors
• Computing small pivot-minors
• Vertex-minors of graphs: a survey
• A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
• Prime vertex-minors of a prime graph
• The average cut-rank of graphs
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• The Minset-Poset Approach to Representations of Graph Connectivity
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• Connectivity, graph minors, and subgraph multiplicity

This page was built for publication: Rank connectivity and pivot-minors of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107500)