---
title: Minimum Anti-Forcing Set in Graphs
url: https://www.emergentmind.com/topics/minimum-anti-forcing-set
type: topic
---

# Minimum Anti-Forcing Set in Graphs

A minimum anti-forcing set is, in its original graph-theoretic sense, a minimum-cardinality set of edges excluded from a fixed perfect matching so that the matching becomes unique after those edges are removed. Formally, if \(G\) has a perfect matching \(M\), then a set \(S \subseteq E(G)\setminus M\) is an anti-forcing set of \(M\) when \(G-S\) has \(M\) as its unique perfect matching, and any such set with \(|S|=af(G,M)\) is a minimum anti-forcing set. The notion sits at the intersection of matching theory, cycle transversals, planar duality, and chemical graph theory, and later admits a broader formulation for general optimal-solution families in combinatorial optimization [1406.3796] [2509.24309].

## 1. Definitions, variants, and the cycle-hitting viewpoint

Let \(G\) be a finite simple graph with at least one perfect matching. For a perfect matching \(M\), the anti-forcing number is
\[
af(G,M)=\min\{\,|S|:S\subseteq E(G)\setminus M,\ G-S\text{ has a unique perfect matching}\,\}.
\]
A “minimum anti-forcing set” is any \(S \subseteq E(G)\setminus M\) attaining this minimum. At graph level, the literature distinguishes the minimum and maximum over perfect matchings: one convention writes
\[
af(G)=\min_{M\in PM(G)} af(G,M),\qquad Af(G)=\max_{M\in PM(G)} af(G,M).
\]
This distinction is essential: \(af(G,M)\) is attached to a fixed matching, whereas \(af(G)\) and \(Af(G)\) summarize the full matching space [1406.3796].

The basic structural object is an \(M\)-alternating cycle, namely a cycle whose edges alternate between \(M\) and \(E(G)\setminus M\). The fundamental characterization is that \(S \subseteq E(G)\setminus M\) is an anti-forcing set of \(M\) if and only if \(S\) contains at least one edge of every \(M\)-alternating cycle. Equivalently, \(af(G,M)\) is the minimum size of a hitting set for the hypergraph of \(M\)-alternating cycles. This makes minimum anti-forcing a transversal problem rather than a direct uniqueness problem [1406.3796].

Related forcing notions use inclusion rather than exclusion. For a fixed perfect matching, a forcing set is a subset of \(M\) meeting every \(M\)-alternating cycle, while a global forcing set is an edge set distinguishing all perfect matchings. In the global theory, “nice cycles” also appear: a cycle \(C\) is nice if \(G-C\) has a perfect matching, equivalently if two perfect matchings differ exactly on \(E(C)\) [2009.05746].

The same exclusion-based schema extends beyond perfect matchings. If \(\Pi \subseteq 2^E\) is the set of optimal solutions of a combinatorial optimization problem and \(X\in \Pi\), then \(S\subseteq E\) is an anti-forcing set for \(X\) if \(S\cap X=\emptyset\) and every other \(X'\in \Pi\setminus\{X\}\) intersects \(S\). Equivalently, \(X\) is the unique optimal solution disjoint from \(S\) [2509.24309].

## 2. Planar bipartite graphs and the minimax theorem

For plane bipartite graphs, anti-forcing admits a sharp packing-transversal formulation. Two \(M\)-alternating cycles are called compatible if they are disjoint or intersect only at edges of \(M\). Let \(c'(M)\) denote the maximum size of a compatible \(M\)-alternating set. Then, for a planar bipartite graph with perfect matching \(M\),
\[
af(G,M)=c'(M).
\]
Thus, in this setting, a minimum anti-forcing set has the same cardinality as a maximum compatible packing of alternating cycles [1406.3796].

The proof uses an orientation-contraction transformation. Edges in \(M\) are oriented from white to black, edges outside \(M\) from black to white, and then all \(M\)-edges are contracted. In the resulting planar digraph, \(M\)-alternating cycles correspond to directed cycles, and anti-forcing sets correspond to feedback arc sets. The Lucchesi–Younger theorem then identifies the minimum feedback arc set size with the maximum number of arc-disjoint directed cycles, which translates back to the equality \(af(G,M)=c'(M)\) [1406.3796].

This minimax theorem gives a constructive interpretation of minimum anti-forcing sets. In plane bipartite graphs, the problem can be approached by computing either a maximum compatible family of \(M\)-alternating cycles or a minimum feedback arc set in the contracted planar digraph. The result is exact, but the cited work does not state an explicit complexity bound for the general plane-bipartite computation; its algorithmic content is primarily structural and existential [1406.3796].

The planar bipartite equality is not universal. Outside the plane bipartite class, the relation \(af(G,M)=c'(M)\) may fail. The dodecahedron is cited as a counterexample: for a suitable perfect matching, there are at most three compatible \(M\)-alternating cycles, but the anti-forcing number is at least four. A common misconception is therefore to treat compatible alternating-cycle packing as a general formula; it is a theorem of the planar bipartite regime, not of arbitrary graphs [1406.3796].

## 3. Relations with forcing and global forcing invariants

The comparison between minimum anti-forcing sets and forcing-type invariants is most explicit through the global forcing number
\[
gf(G):=\min\{\,|S|:S\subseteq E(G)\text{ is a global forcing set of }G\,\}.
\]
A set is global forcing exactly when it intersects each nice cycle of \(G\). The paper on global forcing versus maximum anti-forcing establishes a bridge lemma: if \(S\) is a minimum global forcing set, then there exists \(F\subseteq S\) such that \(G-(S\setminus F)\) has a unique perfect matching. This connects minimum global cycle transversals to anti-forcing-type uniqueness certificates [2009.05746].

For bipartite graphs with a perfect matching,
\[
gf(G)\ge Af(G).
\]
Since \(Af(G)=\max_M af(G,M)\), it follows that
\[
af(G,M)\le gf(G)\quad\text{for every perfect matching }M
\]
in the bipartite case. The same inequality extends to the class \(\mathcal G\) of graphs with a perfect matching and no two disjoint odd cycles \(C,C'\) such that \(G-C-C'\) still has a perfect matching. It also holds for graphs whose perfect matching polytopes consist of non-negative 1-regular vectors; for bricks, this is equivalent to solidity [2009.05746].

The quantitative gap \(gf(G)-Af(G)\) is sharply bounded. For a connected bipartite graph with \(2n\) vertices,
\[
0\le gf(G)-Af(G)\le \tfrac12 (n-1)(n-2),
\]
with equality on the right if and only if \(G\cong K_{n,n}\). For connected graphs with \(2n\) vertices, not necessarily bipartite,
\[
-\tfrac12 (n^2-n-2)\le gf(G)-Af(G)\le (n-1)(n-2),
\]
the upper bound being attained by \(K_{2n}\), while the lower bound is tight only for \(n=2\) [2009.05746].

These bounds clarify the status of minimum anti-forcing sets. In bipartite and \(\mathcal G\)-graphs, minimum anti-forcing sets for any fixed perfect matching are never larger than minimum global forcing sets. In general non-bipartite graphs, however, the direction can reverse. The matching covered family \(G_k\) satisfies
\[
gf(G_k)=3k-1,\qquad Af(G_k)=4k-1,\qquad gf(G_k)-Af(G_k)=-k,
\]
showing that anti-forcing can exceed global forcing by an arbitrarily large additive amount outside the controlled classes [2009.05746].

## 4. Hexagonal systems, benzenoid chemistry, and fullerene classes

In chemical graph theory, perfect matchings are Kekulé structures, and anti-forcing measures how many non-Kekulé edges must be deleted to leave a unique Kekulé structure. For hexagonal systems \(H\), the maximum anti-forcing number equals the Fries number:
\[
Af(H)=Fries(H).
\]
Combined with the known identity \(F(H)=Cl(H)\) for the maximum forcing number, this yields the Fries–Clar inequalities
\[
Cl(H)\le Fries(H)\le 2Cl(H).
\]
Accordingly, maximum anti-forcing sets in benzenoid graphs are tied to classical resonance indices rather than being merely auxiliary matching invariants [1406.3796].

The cata-condensed subclass admits a more refined description. If \(H\) is a cata-condensed hexagonal system, then the anti-forcing spectrum
\[
Spec_{af}(H)=\{\,af(H,M):M\text{ is a perfect matching of }H\,\}
\]
is continuous: it is an integer interval
\[
Spec_{af}(H)=[af(H),Fries(H)].
\]
Here the inner dual \(H^*\) is a tree, all cycles are nice, and one can choose a maximum non-crossing compatible \(M\)-alternating set with minimal \(h\)-index; such a set contains all \(M\)-alternating hexagons. For these systems, a minimum anti-forcing set for a fixed \(M\) can be constructed by selecting one non-\(M\) edge from each cycle in a maximum non-crossing compatible \(M\)-alternating set [1411.5468].

Several explicit values are known. For a single hexagon, \(Spec_{af}(H)=\{1\}\). For a linear chain with \(n>1\) hexagons,
\[
Spec_{af}(H)=[1,2].
\]
Hence benzene has anti-forcing spectrum \(\{1\}\), while naphthalene, anthracene, and all longer linear polyacenes have spectrum \([1,2]\). The strict inequality
\[
af(H)<Fries(H)
\]
holds for cata-condensed systems with at least two hexagons [1411.5468].

Fullerenes exhibit a different anti-forcing profile. For fullerene graphs \(F\), the cited work reports the lower bound
\[
af(F)\ge 4,
\]
and discusses the families with \(af(F)=4\). It also states that, except for the exceptional fullerene \(F_{24}\), every fullerene with anti-forcing number \(4\) has minimum forcing number \(3\); nanotube fullerenes of type \((4,2)\) are examples. The same source notes that \(F_{24}\) satisfies \(af(F_{24})=4\) while being exceptional for the forcing-number bound [1812.03750].

## 5. Extremal values, spectra, and structural decompositions

For connected graphs with a perfect matching, the maximum anti-forcing number is bounded by the cyclomatic number
\[
\mu(G)=|E(G)|-|V(G)|+1:
\qquad af_{\max}(G)\le \mu(G).
\]
If \(G\) is non-bipartite, then the inequality is strict:
\[
af_{\max}(G)<\mu(G).
\]
The proof strategy deletes non-\(M\) cycle edges until a spanning tree remains; the deleted edges form an anti-forcing set, and odd cycles explain the strictness in the non-bipartite case [1607.05392].

The extremal equality \(af_{\max}(G)=\mu(G)\) is structurally rigid. It holds precisely for planar bipartite graphs whose blocks are either fixed edges or normal components admitting a suitable bipartite ear decomposition. In the elementary case with \(\mu(G)\ge 2\), there is a unique perfect matching \(M\) for which \(af(G,M)=\mu(G)\). This identifies extremal anti-forcing with a compatible fundamental cycle basis of the cycle space [1607.05392].

At the opposite end, plane elementary bipartite graphs with minimum anti-forcing number one are characterized by a local face configuration. Such a graph has an anti-forcing edge if and only if there exists a perfect matching \(M\) such that the graph has exactly two \(M\)-resonant faces whose boundaries have a common path of length at least \(3\); any non-\(M\) edge on that common path is an anti-forcing edge. Thus \(af_{\min}(G)=1\) is governed by a very specific resonant-face overlap pattern rather than by global sparsity alone [1607.05392].

Even polygonal chains provide a particularly explicit spectral theory. Their anti-forcing spectrum is an integer interval, and both endpoints are computable in linear time. If \((L_1,\dots,L_t)\) is the segment decomposition, then
\[
af_{\min}(G)=t.
\]
If \((B_1,\dots,B_m)\) is the all-kink decomposition, then
\[
af_{\max}(G)=\sum_{i=1}^{m}\mu(B_i).
\]
Consequences include the formulas \(af_{\min}(G)=\lceil n/3\rceil\) for all-kink chains without 4-cycles and \(af_{\min}(G)=\lceil n/2\rceil\) for straight chains of \(n\) squares. One worked example in the cited paper yields
\[
Spec_{af}(G)=[6,13].
\]
These results show that minimum anti-forcing sets can sometimes be located by deterministic decomposition rules rather than by unrestricted cycle hitting [1607.05392].

## 6. Generalization to shortest paths, spanning trees, and matroid bases

Later work extends anti-forcing from perfect matchings to arbitrary optimal-solution families. If \(\Pi\subseteq 2^E\) is the set of optimal solutions of a weighted combinatorial problem, a set \(S\) is anti-forcing for \(X\in\Pi\) when \(S\cap X=\emptyset\) and every other optimal solution intersects \(S\). In this form, minimum anti-forcing becomes a general tie-breaking problem by exclusion rather than a matching-specific invariant [2509.24309].

For shortest \(s\)-\(t\) paths, the complexity landscape is asymmetric. Minimum forcing is polynomial, solvable in \(O(nm)\) time by reducing to the shortest-path DAG and dynamic programming. By contrast, minimum anti-forcing for shortest paths is NP-complete even on undirected unweighted graphs. The cited reduction is from Vertex Cover. Two tractable special cases are also identified: when a specific shortest path \(P\) is given, a minimum anti-forcing set disjoint from \(P\) can be found in polynomial time via minimum multiway cut on the DAG \(D\setminus E(P)\); and on bounded-treewidth graphs, the problem is solvable in linear time through MSO\(_2\) formulations and Courcelle’s theorem [2509.24309].

For minimum spanning trees, both forcing and anti-forcing are polynomial-time computable. The paper gives \(O(m\log n)\)-time Kruskal-style algorithms operating on equal-weight tie classes. For anti-forcing, within each tie class \(E_{\min}\), one computes a maximal forest \(F_{\min}\), adds \(E_{\min}\setminus F_{\min}\) except self-loops to the anti-forcing set, contracts \(E_{\min}\), and iterates. The same perspective extends to minimum-weight bases of a matroid presented by an independence oracle, where minimum forcing and anti-forcing sets are computable in polynomial time, and forcing in a matroid is dual to anti-forcing for maximum bases in the dual matroid [2509.24309].

This broader optimization framework suggests a conceptual continuity with the original matching theory. In all cases, a minimum anti-forcing set is an exclusion set of minimum cardinality that destroys all alternative optimal solutions while leaving one designated optimum intact. What varies is the structure of the obstruction family: alternating cycles for perfect matchings, recombinable subpaths in shortest-path DAGs, and exchangeable equal-weight choices in spanning-tree and matroid tie classes [2509.24309].

Source: https://www.emergentmind.com/topics/minimum-anti-forcing-set