---
title: Paired Many-to-Many 2-Disjoint Path Cover
url: https://www.emergentmind.com/topics/paired-many-to-many-2-disjoint-path-cover
type: topic
---

# Paired Many-to-Many 2-Disjoint Path Cover

Searching arXiv for the cited paper and closely related work on paired many-to-many 2-disjoint path covers.
Searching for 2310.18831.
Searching for "Paired 2-disjoint path covers of burnt pancake graphs with faulty elements".
Paired many-to-many 2-disjoint path cover is a spanning path-cover problem in which, for two disjoint 2-vertex sets \(S=\{u,x\}\) and \(T=\{v,y\}\), one seeks two vertex-disjoint paths \(P_{uv}\) and \(P_{xy}\) with endpoints \((u,v)\) and \((x,y)\) such that \(V(G)=V(P_{uv})\cup V(P_{xy})\) [2507.15463]. In the terminology used for burnt pancake graphs, a paired 2-disjoint path cover is a set \(\{P[u,v],Q[x,y]\}\) of two vertex-disjoint paths whose vertex sets partition the graph, and in faulty settings the paths are required to lie in the residual graph after deleting faulty vertices and edges [2310.18831]. The topic is closely connected to Hamiltonian connectivity, Hamiltonian laceability, linkage, and fault-tolerant routing, and it has been studied in interconnection-network families such as balanced hypercubes, burnt pancake graphs, Johnson graphs, and BCube, as well as in directed and shortest-path routing variants [2402.13786].

## 1. Definition and variant structure

In its standard undirected form, the paired many-to-many 2-disjoint path cover problem fixes the pairing in advance: \(u\) must be joined to \(v\), and \(x\) must be joined to \(y\) [2507.15463]. This distinguishes it from unpaired many-to-many path cover problems, where a permutation of the terminal sets may be chosen by the construction. The balanced-hypercube literature makes this distinction explicit: a paired \(k\)-DPC uses the identity permutation, whereas an unpaired \(k\)-DPC allows an arbitrary permutation \(\psi\) between the two endpoint sets [1912.05443].

The fault-tolerant formulation deletes a set \(F\subseteq V(G)\cup E(G)\) of faulty elements and asks for the same two-path vertex partition in \(G-F\). For burnt pancake graphs, the residual graph is defined by removing faulty vertices, faulty edges, and all edges incident with faulty vertices; a fault-free paired 2-DPC is then a paired 2-DPC in that residual graph [2310.18831]. In edge-fault-only models, such as the balanced hypercube and BCube settings, the same cover condition is imposed after deleting the faulty edges [1804.01949].

In bipartite interconnection networks, endpoint placement is constrained by parity. For \(BH_n\), the graph is bipartite, and the literature requires \(S\) to lie in one partite set and \(T\) in the other; the same parity condition underlies the many-to-many constructions in balanced hypercubes more generally [1804.01949]. Directed analogues replace undirected paths by directed paths. In the digraph formulation, a paired many-to-many 2-DDPC is a pair of vertex-disjoint directed paths \(P_1,P_2\) such that \(P_1\) is an \(s_1\)–\(t_1\) path, \(P_2\) is an \(s_2\)–\(t_2\) path, and \(V(P_1)\cup V(P_2)=V(D)\) [2402.13786].

A related global property is paired 2-coverability: a graph is paired 2-coverable if every choice of two disjoint 2-vertex sets \(S=\{u,x\}\) and \(T=\{v,y\}\) admits such a cover [2507.15463]. This property is stronger than the existence of a single Hamiltonian path and stronger than unpaired many-to-many coverage guarantees.

## 2. Structural prerequisites and global degree principles

A general structural principle is that paired 2-coverability implies Hamilton-connectedness. For Johnson graphs, it is stated explicitly that if a graph is paired 2-coverable, then it must be Hamilton-connected, but the reverse is not true [2507.15463]. The same paper gives a counterexample to the converse: a Hamilton-connected graph obtained from the 3-dimensional hypercube \(Q_3\) by adding the edges \(\{000,011\}\) and \(\{100,111\}\) is not paired 2-coverable for the terminal choice \(u=000\), \(v=101\), \(x=100\), \(y=001\) [2507.15463]. This separates spanning two-path decompositions from ordinary Hamiltonian connectivity.

Many existence proofs use Hamiltonian connectivity or Hamiltonian laceability as a backbone. In balanced hypercubes, Hamiltonian laceability is the paired 1-disjoint path cover and serves as a local ingredient for paired 2-DPC and paired 3-DPC constructions [1912.07070]. In burnt pancake graphs, Kaneko’s results are used in the form: if \(|F|\le n-2\), then \(BP_n-F\) is Hamiltonian, and if \(|F|\le n-3\), then \(BP_n-F\) is Hamiltonian-connected [2310.18831]. In Johnson graphs, Alspach’s Hamilton-connectedness theorem is the starting point for the proof that all \(J(n,k)\) are paired 2-coverable [2507.15463].

For digraphs, the sharp global condition currently available is Ore-type. If \(D\) is a digraph of order \(n\) and \(d^+(x)+d^-(y)\ge n+2\) for each missing arc \(xy\notin A(D)\), then \(D\) is paired many-to-many 2-coverable [2402.13786]. The proof augments the digraph with one auxiliary vertex \(w\), applies the Overbeck-Larisch Hamiltonian-connectedness criterion in the augmented digraph, and then splits a Hamiltonian path at \(w\) into the required two spanning directed paths [2402.13786]. The bound is sharp: there exists a digraph on \(n\ge 9\) vertices with \(d^+(x)+d^-(y)=n+1\) for each missing arc that is not paired many-to-many 2-coverable because every \(s_1\)–\(t_1\) path and every \(s_2\)–\(t_2\) path are forced through a single vertex \(z\) [2402.13786].

## 3. Burnt pancake graphs and mixed faulty elements

The most detailed mixed-fault theorem currently in the supplied literature concerns the burnt pancake graph \(BP_n\), the Cayley graph of the hyperoctahedral group \(B_n\) generated by signed prefix reversals \(r_1,\dots,r_n\) [2310.18831]. A signed permutation \(u=u_1u_2\cdots u_n\) has \(u_i\in\{\pm1,\pm2,\dots,\pm n\}\), and
\[
r_i(u_1u_2\cdots u_i\cdots u_n)=\bar u_i\,\bar u_{i-1}\cdots \bar u_1\,u_{i+1}\cdots u_n,\qquad \bar k=-k.
\]
The graph \(BP_n=\mathrm{Cay}(B_n,\{r_1,r_2,\dots,r_n\})\) has
\[
|V(BP_n)|=n!\cdot 2^n,\qquad \deg(BP_n)=n,\qquad |E(BP_n)|=n\cdot n!\cdot 2^{n-1}.
\]
It admits a canonical decomposition into \(2n\) induced subgraphs \(BP_n^i\), \(i\in\{\pm1,\pm2,\dots,\pm n\}\), each isomorphic to \(BP_{n-1}\). For \(i\neq j\), the inter-subgraph edge set \(E_{i,j}(BP_n)\) forms a matching, and
\[
|E_{i,j}(BP_n)|=
\begin{cases}
(n-2)!\cdot 2^{n-2}, & \text{if } i\neq \bar j,\\
0, & \text{if } i=\bar j.
\end{cases}
\]
Every vertex \(v\in BP_n^i\) has a unique out-neighbor \(v^n\) outside \(BP_n^i\) via its \(r_n\)-edge [2310.18831].

The main theorem states that if \(n\ge 4\) and \(F\subseteq V(BP_n)\cup E(BP_n)\) with \(|F|\le n-4\), then for any two pairs \(\{u,v\}\) and \(\{x,y\}\) of distinct vertices there exist vertex-disjoint paths \(P[u,v]\) and \(Q[x,y]\) in \(BP_n-F\) with \(V(P)\cup V(Q)=V(BP_n-F)\) and \(V(P)\cap V(Q)=\emptyset\) [2310.18831]. Faulty elements may be vertices and/or edges, so the bound \(n-4\) is a mixed-fault guarantee.

The construction is inductive. If faults are spread so that each \(BP_n^i\) has at most \(n-5\) faults, the induction hypothesis supplies local 2-DPCs in each subgraph, and the matchings \(E_{i,j}(BP_n)\) permit global splicing. In the worst-case concentration, one subgraph \(BP_n^{k^\ast}\) may contain exactly \(n-4\) faults while all others and all out-edges are fault-free; the proof then performs a detailed case analysis over all terminal distributions across one, two, three, or four subgraphs [2310.18831]. A key lemma ensures out-neighbor separation: if two vertices lie in the same \(BP_n^i\) and have distance at most \(2\), then their out-neighbors are distinct; if they lie in different \(BP_n^i\), distance at most \(3\) also forces distinct out-neighbors [2310.18831].

The impossibility threshold is not fully closed, but a sharp lower obstruction is known at \(n-2\) faults. For every \(n\ge 3\), there exists a set of \(n-2\) faulty edges or a set of \(n-2\) faulty vertices such that no fault-free paired 2-DPC exists in \(BP_n-F\) for some terminal pairs [2310.18831]. The explicit counterexample chooses \(u\) and \(x\) at distance \(2\) with common neighbor \(w\), then faults the \(n-2\) edges at \(w\) other than \(wu\) and \(wx\), or instead faults the corresponding adjacent vertices. Any fault-free path through \(w\) is then forced to pass both \(u\) and \(x\), which prevents two disjoint covering paths [2310.18831]. The status at \(n-3\) faults remains open: the paper asks whether the bound \(n-4\) can be improved to \(n-3\) for all \(n\ge 4\) [2310.18831].

The proofs are constructive. They specify how to choose edges or vertices, cut Hamiltonian paths or cycles, and splice the resulting pieces through out-edge matchings. Given implementations of Hamiltonian path and cycle routines in the subgraphs, the overall procedure builds the two paths in a number of steps proportional to the number of subgraphs visited; the output size is \(|V(BP_n-F)|\), so the construction is linear in the output length and polynomial in \(|V|\) [2310.18831].

## 4. Established graph families and exact guarantees

Several graph classes now admit exact paired many-to-many 2-disjoint path cover theorems.

| Graph family | Guarantee | Reference |
|---|---|---|
| Balanced hypercube \(BH_n\) | Fault-free paired 2-DPC for any \(S=\{s_1,s_2\}\subseteq V_0\), \(T=\{t_1,t_2\}\subseteq V_1\); with faulty edges, the bound \(|F|\le 2n-3\) is optimal | [1804.01949] |
| Johnson graph \(J(n,k)\) | \(J(n,k)\) is paired 2-coverable for all \(n\ge 4\) and \(n>k\ge 1\) | [2507.15463] |
| Layered Johnson family \(QJ(n,A)\) | If \(|V(QJ(n,A))|\ge 4\) and \(n\ge 4\), then \(QJ(n,A)\) is paired 2-coverable | [2507.15463] |
| BCube \(BC_{n,k}\) | Under \(l\)-PEF, for any source set \(\{s_1,s_2\}\) and target set \(\{t_1,t_2\}\), there exist two disjoint covering paths \(P_1,P_2\) | [2505.02150] |

For balanced hypercubes, the fault-free result had already been established before the fault-tolerant version. The edge-fault theorem states that for \(n\ge 2\), if \(F\subseteq E(BH_n)\) and \(|F|\le 2n-3\), then for any \(S=\{s_1,s_2\}\subseteq V_0\) and \(T=\{t_1,t_2\}\subseteq V_1\), there exist two vertex-disjoint simple paths \(P_1,P_2\subseteq BH_n-F\) with \(P_1:s_1\leadsto t_1\), \(P_2:s_2\leadsto t_2\), \(V(P_1)\cup V(P_2)=V(BH_n)\), and \(V(P_1)\cap V(P_2)=\emptyset\) [1804.01949]. The upper bound \(2n-3\) is optimal: with \(2n-2\) faulty edges concentrated around a common neighbor \(w\) of symmetric vertices \(s_1,s_2\), any cover would force both paths through \(w\), contradicting vertex-disjointness [1804.01949]. The later paired 3-disjoint path cover theorem for \(BH_n\), valid for \(n\ge 3\), explicitly treats paired 2-DPC as a previously known special case and extends the same recursive decomposition machinery to three prescribed pairs [1912.07070].

For Johnson graphs, the theorem is unconditional and fault-free. The proof partitions \(V(J(n,k))\) into the vertices \(X\) not containing \(n\), so \(X\cong J(n-1,k)\), and the vertices \(Y\) containing \(n\), so \(Y\cong J(n-1,k-1)\), then performs a five-case analysis according to how many endpoints lie in \(Y\) [2507.15463]. Splicing relies on neighbors obtained by swapping one element and on Hamiltonian paths inside the two induced halves. The same paper proves that the layered family \(QJ(n,A)\), built from levels \(J(n,a_i)\) with vertical edges \(\{u,v\}\) whenever \(u\subset v\), is also paired 2-coverable whenever \(|V(QJ(n,A))|\ge 4\) and \(n\ge 4\) [2507.15463].

For BCube, the relevant fault model is partitioned by dimension. In the logical graph \(BC_{n,k}\), the \(l\)-PEF constraints are \(f_0=0\) and, for \(1\le i\le k\),
\[
f_i\le
\begin{cases}
\max(n^i-5,0), & \text{if } 4\le n\le 9,\\
\left\lceil \frac{n^i-1}{2}\right\rceil (n-1)-n, & \text{if } n\ge 10.
\end{cases}
\]
Under this model, the paper proves Hamiltonian connectivity and then the existence of a paired 2-DPC for arbitrary prescribed source and target pairs [2505.02150]. The per-dimension budgets grow exponentially in \(i\), which is the paper’s “exponential fault tolerance” statement [2505.02150].

A higher-rank generalization appears in bipartite transposition-like graphs. The main theorem there is not restricted to \(k=2\): every rank \(n\) bipartite transposition-like graph admits a paired \((n-1)\)-to-\((n-1)\) disjoint path cover for all choices of \(S=\{s_1,\dots,s_{n-1}\}\) and \(T=\{t_1,\dots,t_{n-1}\}\), provided \(S\) lies in one partite set and \(T\) in the other [2402.11381]. The paper explicitly notes that establishing “paired many-to-many 2-disjoint path covers” in the stronger sense of two internally disjoint \(s_i\)–\(t_i\) paths per pair is an open direction for this class [2402.11381].

## 5. Related formulations and neighboring problems

Several neighboring lines of work relax, generalize, or reinterpret the paired many-to-many 2-disjoint path cover problem.

The hypercube literature contains a closely related but unpaired theorem. In \(Q_n\) with faulty vertices, for \(k=2\), if \(f\le 2n-7\), \(S=\{s_1,s_2\}\subseteq X\), \(T=\{t_1,t_2\}\subseteq Y\), and every fault-free vertex has at least two fault-free neighbors, then there exist two vertex-disjoint fault-free paths whose endpoints are exactly \(S\cup T\) and whose union covers at least \(2^n-2f\) vertices [1204.4252]. The theorem guarantees some pairing between \(S\) and \(T\), not a pre-specified pairing, so it is an unpaired many-to-many result rather than a paired 2-DPC theorem in the strict sense [1204.4252]. Balanced hypercubes also admit a higher-cardinality unpaired result: for \(n\ge 2\), any \(S\subseteq V_0\) and \(T\subseteq V_1\) with \(|S|=|T|=2n-2\) admit an unpaired \((2n-2)\)-DPC, and the upper bound \(2n-2\) is best possible [1912.05443].

A different reinterpretation arises in network design under shortest-path routing. In the cover-by-pairs framework, a customer is covered by two facilities if there exist two disjoint shortest paths from the facilities to that customer. The paper distinguishes pathwise-disjoint coverage (PDFL, relevant with MPLS) from setwise-disjoint coverage (SDFL, relevant with OSPF/IS-IS) and states that the “Paired Many-to-Many 2-Disjoint Path Cover” problem under shortest-path routing is exactly these Set Cover by Pairs formulations with pairwise coverage constraints driven by shortest paths [1611.01210]. This is not a spanning two-path partition of the entire graph; instead, it is a facility-location optimization problem in which each customer must be served by two disjoint shortest paths from selected facilities [1611.01210].

In directed acyclic graphs, the closely related MinPCRP problem asks for a minimum-cardinality path cover such that both vertices of every required pair belong to the same path. The paper proves a sharp computational boundary: deciding whether there exists a solution consisting of at most three paths is NP-complete, whereas deciding whether a solution consisting of at most two paths exists is polynomial-time solvable via reduction to 2-Clique Partition in an auxiliary compatibility graph [1310.5037]. This is not the same as fixing two prescribed endpoint pairs, but it addresses the two-path cover regime with pair constraints on path co-membership.

## 6. Methods, applications, and open questions

Across graph families, the dominant proof pattern is recursive decomposition plus splicing. Burnt pancake graphs decompose into \(2n\) copies of \(BP_{n-1}\) linked by matchings of \(r_n\)-edges [2310.18831]. Balanced hypercubes decompose into four \(BH_{n-1}\) subcubes, with crossing edges and 8-cycles used to reroute and concatenate local covers [1804.01949]. Johnson graphs split into two induced Johnson graphs according to containment of a distinguished element \(n\), and \(QJ(n,A)\) uses vertical inclusion edges between consecutive levels [2507.15463]. BCube partitions along one coordinate into \(n\) sub-BCubes, each isomorphic to \(BC_{n,k-1}\), then lifts local path pieces through non-faulty inter-subgraph edges and Hamiltonian paths in the remainder [2505.02150]. This recurring architecture suggests that paired many-to-many 2-DPC is especially tractable in recursively defined, highly symmetric graph families with abundant inter-module matchings.

The main application domain is fault-tolerant interconnection networks. For burnt pancake graphs, paired many-to-many 2-disjoint path covers are motivated by full utilization, load balancing, and redundancy: they partition the network’s vertices between two end-to-end routes and remain available under up to \(n-4\) mixed faulty elements [2310.18831]. In BCube, the same idea is tied to message passing under large numbers of link failures, with per-level budgets growing exponentially in the dimension index [2505.02150]. In shortest-path routing networks, the paired-cover viewpoint underlies monitor placement and robust content distribution, with SDFL modeling OSPF/IS-IS and PDFL modeling MPLS [1611.01210].

Several open questions remain explicit in the cited literature. For burnt pancake graphs, the central unresolved issue is whether the mixed-fault bound \(n-4\) can be improved to \(n-3\) for all \(n\ge 4\) [2310.18831]. In hypercubes with faulty vertices, the theorem for \(k=2\) guarantees some pairing but not a predetermined pairing, and extending the stronger vertex-fault bound to mixed vertex-plus-edge faults is stated as a natural direction [1204.4252]. For BCube, the paper focuses on \(m=2\) and states that generalization to \(m>2\) is only suggested by the hierarchical splicing strategy, not proved [2505.02150]. For bipartite transposition-like graphs, the stronger requirement of two internally disjoint \(s_i\)–\(t_i\) paths for each pair is explicitly left open [2402.11381].

The current body of work therefore presents paired many-to-many 2-disjoint path cover as a sharply structured spanning problem: stronger than Hamiltonian connectivity, sensitive to pairing and parity, highly compatible with recursive network topologies, and increasingly integrated with fault models, routing constraints, and degree-theoretic conditions across both undirected and directed settings.

Source: https://www.emergentmind.com/topics/paired-many-to-many-2-disjoint-path-cover