---
title: 'Pivot-Minor: Concepts & Applications'
url: https://www.emergentmind.com/topics/pivot-minor
type: topic
---

# Pivot-Minor: Concepts & Applications

Searching arXiv for recent and foundational papers on pivot-minors to ground the article.
A **pivot-minor** of a graph is a graph obtained by a sequence of edge pivots and vertex deletions. The pivot operation is a binary-field analogue of a minor-like reduction: it is local, invertible up to repeated pivots, and admits equivalent descriptions in combinatorial, matrix, and matroidal language. Across graph theory, binary matroid theory, width parameters, extremal combinatorics, algorithms, and quantum information, pivot-minors provide a containment relation that is weaker than induced subgraph containment and, in general, stronger than the restrictions imposed by ordinary minor theory. They play for rank-width and related parameters a role analogous to that of graph minors for tree-width [2011.03205], [2311.04656].

## 1. Definition and equivalent formulations

Let \(G\) be a simple graph and let \(uv\in E(G)\). Define
\[
V_1 = N_G(u)\setminus (N_G(v)\cup\{v\}),\qquad
V_2 = N_G(v)\setminus (N_G(u)\cup\{u\}),\qquad
V_3 = N_G(u)\cap N_G(v).
\]
The pivot of \(G\) on the edge \(uv\), denoted \(G\pivot uv\) or \(G\wedge uv\), is obtained by complementing all edges between \(V_1\) and \(V_2\), between \(V_2\) and \(V_3\), and between \(V_3\) and \(V_1\), and then swapping the labels of \(u\) and \(v\) [2011.03205], [2507.23182]. An equivalent formulation is
\[
G\pivot uv = G*u*v*u = G*v*u*v,
\]
where \(G*v\) denotes local complementation at \(v\) [1512.03481], [2106.03414].

A graph \(H\) is a pivot-minor of \(G\) if it can be obtained from \(G\) by a finite sequence of pivot operations on edges and deletions of vertices. Equivalently, pivot-minors are exactly the induced subgraphs of graphs that are pivot-equivalent to \(G\) [2011.03205]. In matrix language, pivoting on \(uv\) is the principal pivot transform of the \(2\times 2\) principal submatrix indexed by \(\{u,v\}\) in the adjacency matrix over \(\mathrm{GF}(2)\) [2011.03205], [1203.3606].

This formulation makes the relation to vertex-minors immediate. Since every edge pivot can be written as a sequence of three local complementations, every pivot-minor is a vertex-minor, but the converse need not hold [1512.03481]. In the bipartite case, the two notions coincide [1203.3606]. A standard toy example is that pivoting the middle edge of the path \(P_4\) produces \(C_4\), and deleting one vertex then yields \(C_3\); thus \(C_3\) is a pivot-minor of \(P_4\) [2003.12960].

## 2. Binary matroids and the fundamental-graph correspondence

The central structural interpretation of pivot-minors comes from binary matroid theory. Every binary matroid \(M\) can be represented, after choosing a basis \(B\), by a matrix \([I\mid D]\) over \(\mathrm{GF}(2)\), and the bipartite graph with biadjacency matrix \(D\) is called a **fundamental graph** of \(M\) [2507.23182]. In this setting, every pivot of the fundamental graph corresponds exactly to changing basis in the matroid, and every deletion or contraction of \(M\) corresponds to a vertex-deletion in some pivot of the fundamental graph. Thus pivot-minors of the fundamental graph correspond to minors of the matroid [2507.23182].

This equivalence is the mechanism by which pivot-minor theory imports deep matroid structure. The announced Geelen–Gerards–Whittle theorem states that if \(\mathcal M\) is a proper minor-closed class of binary matroids, then there exist integers \(k,p>0\) such that every \(k\)-connected member of \(\mathcal M\) is a \(p\)-perturbation of either a graphic matroid or a cographic matroid; here \(p\)-perturbation means that in two representations \([I\mid D_1]\) and \([I\mid D_2]\), the difference \(D_1-D_2\) has \(\mathrm{GF}(2)\)-rank at most \(p\) [2507.23182]. Translated to bipartite graphs, this yields the hypothesis that for every fixed bipartite \(H\) there are \(k,t\in\mathbb N\) so that every \(k\)-rank-connected bipartite graph \(G\) with no pivot-minor isomorphic to \(H\) admits partitions \(A=A_1\cup\cdots\cup A_t\) and \(B=B_1\cup\cdots\cup B_t\) such that each block \(G[A_i\cup B_j]\) is either a graphic fundamental graph or the bipartite complement of a graphic fundamental graph [2507.23182].

The same correspondence also underlies several “prime graph” results. If \(G\) is a fundamental graph of a binary matroid \(M\), then pivots correspond to base changes and vertex deletions correspond to deletions or contractions. Consequently, theorems about prime graphs under pivot-minor reduction translate into \(3\)-connected restrictions in binary matroids [2202.07877]. In particular, corollaries for bipartite graphs recover and strengthen wheel-and-whirl type theorems for binary matroids [2202.07877].

## 3. Rank connectivity, rank-width, and obstruction theory

The natural connectivity function for pivot-minors is cut-rank. For \(X\subseteq V(G)\),
\[
\rho_G(X)=\mathrm{rank}_{\mathrm{GF}(2)}\bigl(A_G[X,\,V(G)\setminus X]\bigr).
\]
A graph is \(k^{+\ell}\)-rank-connected if whenever \(\rho_G(X)<k\), one has \(\min\{|X|,\ |V(G)\setminus X|\}<k+\ell\) [2011.03205]. In particular, \(1\)-rank-connected coincides with connectivity, and \(2\)-rank-connected is exactly primeness with respect to split decomposition [2011.03205].

Within this framework, Oum proved a chain theorem: every prime \(3^{+2}\)-rank-connected graph \(G\) with at least \(10\) vertices has a prime \(3^{+3}\)-rank-connected pivot-minor \(H\) with \(|V(H)|=|V(G)|-1\) [2011.03205]. As a corollary, every excluded pivot-minor for the class of graphs of rank-width at most \(k\) has at most
\[
\frac{3.5\cdot 6^{k}-1}{5}
\quad\text{vertices for }k\ge 2,
\]
and the excluded pivot-minors for rank-width at most \(2\) have at most \(16\) vertices [2011.03205].

The relation to width parameters is especially tight. Every graph of rank-width at most \(k\) is a pivot-minor of some graph of tree-width at most \(2k\), and if \(\mathrm{lrw}(G)\le k\) then \(G\) is a pivot-minor of a graph of path-width at most \(k+1\) [1203.3606]. At width \(1\), the theory becomes exact: graphs of rank-width at most \(1\) are exactly vertex-minors of trees, graphs of linear rank-width at most \(1\) are exactly vertex-minors of paths, bipartite graphs of rank-width at most \(1\) are exactly pivot-minors of trees, and bipartite graphs of linear rank-width at most \(1\) are exactly pivot-minors of paths [1203.3606].

Obstruction-size theory gives a complementary finiteness perspective. For a fixed finite field \(\mathbb F\), every forbidden pivot-minor for the class of \((\mathrm{skew}\text{-})\)symmetric matrices of linear rank-width at most \(p\) has order at most \(2^{2^{O(p)}}\), more precisely at most \(c^{\,2^{O(p)}}\) when \(|\mathbb F|=c\); as a corollary, every forbidden vertex-minor obstruction for graphs of linear rank-width at most \(p\) has order at most \(2^{2^{O(p)}}\) [1412.6201].

For tree exclusions, the pivot-minor analogue of the Robertson–Seymour path-width theorem is only partially valid. If \(T\) is a tree that is not a caterpillar, then the class of distance-hereditary graphs excluding \(T\) as a pivot-minor has unbounded linear rank-width. It is conjectured that boundedness holds when \(T\) is a caterpillar, and this is verified for caterpillars of order at most \(4\); in particular, every \(P_4\)-pivot-minor-free graph has linear rank-width at most \(3\), and every \(K_{1,3}\)-pivot-minor-free graph has linear rank-width at most \(59\) [2008.00561].

## 4. Degree-boundedness and sparse structure

A major recent theorem concerns sparse classes defined simultaneously by subgraph exclusion and pivot-minor exclusion. For every bipartite graph \(H\), there is a function \(f_H(s)\) such that for every \(s>0\), any graph \(G\) with no \(K_{s,s}\) subgraph and no pivot-minor isomorphic to \(H\) has average degree at most \(f_H(s)\) [2507.23182]. The proof passes through an induced bipartite \(C_4\)-free subgraph of large average degree, then an induced \(k\)-rank-connected subgraph, and finally the bipartite matroid-minor structure hypothesis described above [2507.23182].

The block decomposition reduces the problem to graphic fundamental graphs and their bipartite complements. In that setting, two degree lemmas drive the estimate: every \(K_{s,t}\)-free graphic fundamental graph has a vertex of degree at most \(\max\{2s-2,\ t-1\}\), and every \(K_{s,s}\)-free bipartite complement of a graphic fundamental graph has a vertex of degree at most \(5s-1\) [2507.23182]. Summing the resulting blockwise edge bounds yields the global average-degree bound.

A related theorem identifies a sharp local sparsity phenomenon for bipartite circle graphs. By a theorem of de Fraysseix, a bipartite graph is a circle graph if and only if it is the fundamental graph of some planar graph [2507.23182]. Using the same tree-cycle counting arguments, every \(K_{s,t}\)-free bipartite circle graph with \(s\le t\) has a vertex of degree at most \(\max\{2s-2,\ t-1\}\), and the paper gives tightness examples: \(K_{t-1,t-1}\) when \(t-1>2s-2\), and the \((s-1)\)-blow-up of \(C_6\) when \(2s-2\ge t\) [2507.23182].

These results place pivot-minor exclusion inside the sparse-structure program. The data explicitly note that degree-boundedness results help with colouring and sparse-structure questions, including the Erdős–Hajnal property, in pivot-minor-closed classes [2507.23182].

## 5. Extremal, unavoidable, and prime-structure consequences

Pivot-minor exclusion has strong extremal consequences. Davies proved that every proper pivot-minor-closed class of graphs has the strong Erdős–Hajnal property: for every graph \(H\), there exists \(\epsilon>0\) such that every \(n\)-vertex graph with no pivot-minor isomorphic to \(H\) contains disjoint sets \(A,B\) with \(|A|,|B|\ge \epsilon n\) and \(A\) complete or anticomplete to \(B\) [2305.09133]. An earlier special case established the same conclusion when the excluded pivot-minor is a fixed cycle \(C_k\) [2003.12960].

Colouring results are known at least for cycles. For all positive integers \(q\) and \(k\ge 3\), every graph with sufficiently large chromatic number contains either a clique of size \(q\) or a pivot-minor isomorphic to a cycle of length \(k\); equivalently, the class of \(C_k\)-pivot-minor-free graphs is \(\chi\)-bounded [1512.03481]. The proofs use induced paths, parity-controlled pivoting along corridors, and “incomplete fan” configurations [1512.03481].

At the opposite structural extreme, large rank-depth forces unavoidable pivot-minors. For every positive integer \(t\), every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on \(t\) vertices or to \(K_tK_t\), where \(K_tK_t\) denotes two disjoint cliques of size \(t\) joined by a half graph [2507.12697]. This answers an open problem raised by Kwon, McCarty, Oum, and Wollan in 2021 [2507.12697].

Prime-structure theorems identify exceptional graphs in which pivot-minor reduction cannot preserve primeness in many ways. Every prime graph with at least four vertices has at least two non-pivotal vertices unless it is pivot-equivalent to a cycle, and it has at least three non-pivotal vertices if and only if it is not pivot-equivalent to a graph consisting of at least two internally-disjoint paths between two fixed distinct vertices having no common neighbors [2202.07877]. In the bipartite case, the exceptional family reduces to even cycles and the bipartite members of that path-family [2202.07877].

## 6. Algorithms, complexity, and applications beyond structural graph theory

From the computational perspective, the general decision problem is hard. The **Pivot-Minor** problem—given graphs \(G\) and \(H\), decide whether \(G\) contains a pivot-minor isomorphic to \(H\)—is NP-complete [2311.04656]. The reduction uses the correspondence between pivot-minors of fundamental graphs and minors of binary matroids: for a connected \(3\)-regular graph \(G\) on \(n\ge 5\) vertices, \(G\) has a Hamiltonian cycle if and only if a certain fundamental graph \(G_T\) has a pivot-minor \(K_{1,n-1}\) [2311.04656].

For fixed \(H\), however, several polynomial cases are known. There is a certifying polynomial-time algorithm for \(H\)-Pivot-Minor when \(H\) is an induced subgraph of \(P_3+tP_1\), when \(H=K_{1,t}\), or when \(|V(H)|\le 4\) except for \(H\in\{K_4,\ C_3+P_1\}\) [2311.04656]. The method either bounds the size of all induced-subgraph-minimal graphs containing \(H\) as a pivot-minor, or determines those minimal obstructions explicitly [2311.04656].

The topic also has a direct quantum-information interpretation. In graph-state language, measuring two adjacent qubits in the \(X\)-basis is equivalent, up to known Pauli-\(Z\) by-products, to pivoting on the corresponding edge and then deleting the measured vertices [1202.6551]. This leads to the structural results that every graph on \(n\) vertices is a pivot-minor of a planar graph of size \(O(n^3)\), and even a pivot-minor of a triangular grid of size \(O(n^4)\) [1202.6551]. The same paper proves that measurements in the \((X,Z)\)-plane on graph states represented by triangular grids form a universal measurement-based model of quantum computation [1202.6551].

More broadly, pivot-minor exclusion and bounded rank-width are linked in the data to efficient model-checking of MSO logic and approximation schemes for many NP-hard problems [2507.23182]. This suggests that the pivot-minor relation is not only a structural analogue of minor containment over \(\mathrm{GF}(2)\), but also an algorithmically meaningful interface between dense graph structure, binary matroids, and width-based decomposition theory.

Source: https://www.emergentmind.com/topics/pivot-minor