Well-Linkedness in Skew-Symmetric Graphs

• The paper establishes an exact equivalence between the b-bipartiteness ratio in an original graph and r-well-linkedness in its sign-duplicated, skew-symmetric counterpart.
• It describes a transformation where the bipartiteness objective is expressed as a cut ratio on an auxiliary graph, converting standard cut problems into symmetry-constrained flow problems.
• The methodology supports cut-matching games and enables an O(log n)-approximation scheme by routing saturating flows on symmetry-respecting terminal pairs for robust certification.

Well-linkedness for skew-symmetric graphs is a symmetry-constrained flow-routability notion introduced to characterize the $b$-bipartiteness ratio of an undirected weighted graph through an auxiliary sign-duplicated graph. In the formulation developed in "Cut-Matching Games for Bipartiteness Ratio of Undirected Graphs" (Soma et al., 17 Jul 2025), the original bipartiteness objective is not treated directly as a standard cut problem on $G$; instead, it is represented as a cut ratio on an auxiliary skew-symmetric graph $G'$, where only cuts and terminal pairs consistent with the involution are relevant. The resulting notion of $r$-well-linkedness is exact rather than approximate: $\beta_b(G)\ge r$ holds if and only if every symmetry-respecting source-sink pair in $G'$ admits a saturating flow at edge capacities scaled by $1/r$.

1. Foundational definitions

For an undirected weighted graph $G=(V,E;w)$ with positive vertex weights $b:V\to \mathbb{Z}_{++}$, the $b$-bipartiteness ratio is defined by

$G$0

and

$G$1

For the original Trevisan bipartiteness ratio, $G$2 (Soma et al., 17 Jul 2025).

If $G$3 induces a tripartition $G$4, where $G$5 on $G$6, $G$7 on $G$8, and $G$9 on $G'$0, then

$G'$1

This form makes explicit that the objective measures the extent to which $G'$2 fails to be bipartite: edges internal to $G'$3 or $G'$4, and edges from $G'$5 to $G'$6, contribute to the numerator.

The auxiliary graph is

$G'$7

where each vertex $G'$8 is duplicated into $G'$9 and $r$0. For each $r$1, the construction adds

$r$2

The weights are copied: $r$3 and the vertex weights are duplicated: $r$4

The skew-symmetric structure is given by the involution

$r$5

and on edges,

$r$6

Equivalently,

$r$7

The paper does not present a fully general abstract definition of skew-symmetric graph; rather, it identifies $r$8 as a special case in the sense of Goldberg–Karzanov style symmetry.

2. Symmetric cuts and the cut representation of bipartiteness ratio

The central transformation is the representation of $r$9 as a cut ratio in $\beta_b(G)\ge r$0. For disjoint $\beta_b(G)\ge r$1, define

$\beta_b(G)\ge r$2

If $\beta_b(G)\ge r$3 corresponds to the tripartition $\beta_b(G)\ge r$4, then

$\beta_b(G)\ge r$5

and therefore

$\beta_b(G)\ge r$6

This identity is the structural basis of the later well-linkedness theorem (Soma et al., 17 Jul 2025).

The derivation is explicit. Edges inside $\beta_b(G)\ge r$7 contribute via $\beta_b(G)\ge r$8, edges inside $\beta_b(G)\ge r$9 via $G'$0, and edges from $G'$1 to $G'$2 via $G'$3. At the same time,

$G'$4

What distinguishes this reduction from ordinary sparsest-cut reductions is that the minimization is not over arbitrary subsets of $G'$5. It is restricted to sets of the form $G'$6, which are consistent with the sign involution. The paper’s main point is that bipartiteness ratio is not naturally a standard cut problem in the original graph $G'$7, but it becomes one in this auxiliary skew-symmetric graph, provided one respects the symmetry constraints. This suggests that the correct flow notion should not be ordinary well-linkedness on $G'$8, but a symmetry-constrained analogue.

3. Symmetric terminal pairs and $G'$9-well-linkedness

A pair $1/r$0 of subsets of $1/r$1 is symmetric if there exist disjoint $1/r$2 such that

$1/r$3

In that case,

$1/r$4

Fix $1/r$5 and such a symmetric pair $1/r$6. The associated network $1/r$7 has vertex set

$1/r$8

Its edges are defined as follows:

• from $1/r$9 to every $G=(V,E;w)$0, capacity $G=(V,E;w)$1;
• from every $G=(V,E;w)$2 to $G=(V,E;w)$3, capacity $G=(V,E;w)$4;
• each edge $G=(V,E;w)$5 has capacity

$G=(V,E;w)$6

A feasible $G=(V,E;w)$7-$G=(V,E;w)$8 flow is saturating if every edge from $G=(V,E;w)$9 and every edge to $b:V\to \mathbb{Z}_{++}$0 is saturated. The symmetric pair $b:V\to \mathbb{Z}_{++}$1 is $b:V\to \mathbb{Z}_{++}$2-well-linked if there exists such a saturating flow in $b:V\to \mathbb{Z}_{++}$3. The auxiliary skew-symmetric graph $b:V\to \mathbb{Z}_{++}$4 is $b:V\to \mathbb{Z}_{++}$5-well-linked if every symmetric pair $b:V\to \mathbb{Z}_{++}$6 is $b:V\to \mathbb{Z}_{++}$7-well-linked (Soma et al., 17 Jul 2025).

The analogy with standard well-linkedness is explicit but qualified. In ordinary undirected sparsest cut, one asks whether every equal-size demand pair $b:V\to \mathbb{Z}_{++}$8 can be routed. Here, two modifications are essential. First, terminal demands are weighted by $b:V\to \mathbb{Z}_{++}$9, not by unit counts. Second, only terminal pairs of the symmetric form

$b$0

are admissible. Accordingly, the notion is neither standard undirected well-linkedness on $b$1 nor ordinary directed well-linkedness: $b$2 is undirected, and the asymmetry arises through the involutive sign structure and the source-sink attachment pattern.

4. Exact characterization theorem

The main theorem states: $b$3 Equivalently, $b$4 if and only if for every symmetric pair $b$5, there exists a saturating $b$6-$b$7 flow in $b$8 (Soma et al., 17 Jul 2025).

The paper also gives a congestion formulation. Let $b$9 denote the case $G$00. Then

$G$01

if and only if for any symmetric $G$02, the network $G$03 has a saturating $G$04-$G$05 flow with congestion at most $G$06.

This equivalence is the flow-cut backbone required for a cut-matching game. In the sparsest-cut setting, the guiding principle is that a lower bound on cut value is equivalent to well-linkedness. For bipartiteness ratio, no such direct statement exists in $G$07 because the objective is indexed by $G$08-labelings, or tripartitions, rather than ordinary two-way cuts. The auxiliary graph $G$09 repairs this mismatch, but only if the relevant cuts and demands are restricted to the symmetric ones induced by the involution.

A plain interpretation is that low bipartiteness ratio corresponds to the existence of a large subset $G$10 that is almost bipartite, in the sense that few edges stay inside $G$11 or inside $G$12, and few edges leave $G$13. In $G$14, this becomes a low-capacity cut separating $G$15 from its complement. The theorem says that the nonexistence of such a witness is exactly equivalent to the routability of all symmetry-consistent terminal pairs.

5. Proof structure and the consistency lemma

The proof proceeds by combining max-flow/min-cut duality with a structural lemma about cuts in the skew-symmetric network. The reduction from $G$16 to symmetric cuts shows that low $G$17 is equivalent to the existence of a low-capacity set $G$18 in $G$19. For a fixed symmetric pair $G$20, a saturating flow in $G$21 exists if and only if the minimum $G$22-$G$23 cut has value at least $G$24.

The technical obstacle is that an arbitrary minimum cut in $G$25 need not respect the $G$26/$G$27 pairing. The paper calls a vertex $G$28 inconsistent in a cut set $G$29 if both $G$30 and $G$31 lie in $G$32; a set is consistent if no vertex is inconsistent. The key lemma states that if $G$33 is a minimum $G$34-$G$35 cut in $G$36, then after deleting from $G$37 both copies of every inconsistent vertex, the resulting consistent set $G$38 is also a minimum cut (Soma et al., 17 Jul 2025).

This lemma is the genuinely skew-symmetric ingredient. Its role is to show that minimum cuts can be converted into symmetry-respecting cuts without increasing their value. A plausible implication is that the involution does not merely organize the graph combinatorially; it constrains the dual certificates in a way that restores compatibility between min-cut structure and $G$39-labelings.

The two directions of the theorem then follow.

For the “if” direction, assume every symmetric pair is $G$40-well-linked. For any symmetric $G$41, the cut $G$42 in $G$43 has value

$G$44

If every minimum cut has value at least $G$45, then

$G$46

so

$G$47

Minimizing over all symmetric $G$48 yields $G$49.

For the “only if” direction, argue contrapositively. If some symmetric pair $G$50 is not $G$51-well-linked, then the minimum $G$52-$G$53 cut in $G$54 has value $G$55. By the consistency lemma, there exists a consistent minimum cut $G$56. Its value is

$G$57

hence

$G$58

Therefore

$G$59

and since consistent $G$60 corresponds to some $G$61, one obtains $G$62.

When a symmetric pair is well-linked, the saturating flow decomposes into $G$63-$G$64 paths. In $G$65, these become odd $G$66-$G$67 paths, odd $G$68-$G$69 paths, and even $G$70-$G$71 paths. This parity pattern is later used by the matching player and aligns with matrix quantities built from $G$72, rather than the Laplacian difference form associated with expansion.

6. Algorithmic role, novelty, and scope

The well-linkedness characterization is the structural engine of the cut-matching game for bipartiteness ratio. In each round, the cut player outputs a tripartition $G$73, equivalently the symmetric pair

$G$74

If $G$75 is not $G$76-well-linked, then a minimum cut in $G$77 yields a witness $G$78 with

$G$79

If $G$80 is $G$81-well-linked, the matching player computes a saturating flow in $G$82, decomposes it into paths, and forms a demand multigraph $G$83 on $G$84 (Soma et al., 17 Jul 2025).

Accumulating these demand graphs yields a certificate graph $G$85. If after $G$86 rounds

$G$87

then because $G$88 embeds into $G$89 through the routed flows with congestion $G$90, the congestion characterization implies

$G$91

The final theorem gives a randomized $G$92-approximation for $G$93-bipartiteness ratio, using

$G$94

single-commodity max-flow computations on an auxiliary graph of size $G$95, plus additional arithmetic work from approximate Gram decomposition. In the case $G$96, the running time is nearly linear with modern undirected max-flow routines.

The matrix object used in the cut-matching analysis is

$G$97

equivalently,

$G$98

For a Gram decomposition

$G$99

with column vectors $G'$00,

$G'$01

The paper explicitly identifies this “$G'$02” form as the analogue of the Laplacian “difference” form used for expansion, reflecting the bipartite-sign nature of the objective.

The novelty lies in introducing well-linkedness for skew-symmetric graphs and proving that it exactly characterizes bipartiteness ratio. The contribution is not presented as a fully general theory for arbitrary skew-symmetric graphs. Several scope conditions are explicit. The skew-symmetric graph definition is implicit through the construction of $G'$03. The property is parameterized by $G'$04, not unparameterized. The algorithm checks the condition only on the symmetric pairs generated by the cut player, rather than globally in one step. The $G'$05 loss arises from the MMWU/cut-matching analysis, not from the well-linkedness characterization itself, which is exact. A common misconception would be to identify this notion with standard well-linkedness on $G'$06; the paper’s framework excludes that interpretation because the meaningful cuts and demand pairs are precisely those compatible with the involution.