Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
54 views

Menger's Theorem For Directed Graphs: X, y V (D) S V (D) / (X, Y) D S X, y

This document summarizes Menger's theorem for directed graphs. It states that for any two vertices x and y in a directed graph D, the minimum size of an x-y separator set S is equal to the maximum number of pairwise internally disjoint x-y paths. It provides a proof of this directed local vertex version of Menger's theorem using König's theorem on matchings and vertex covers in bipartite graphs. It also states corollaries about strong connectivity in directed graphs.

Uploaded by

sahar1344
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Menger's Theorem For Directed Graphs: X, y V (D) S V (D) / (X, Y) D S X, y

This document summarizes Menger's theorem for directed graphs. It states that for any two vertices x and y in a directed graph D, the minimum size of an x-y separator set S is equal to the maximum number of pairwise internally disjoint x-y paths. It provides a proof of this directed local vertex version of Menger's theorem using König's theorem on matchings and vertex covers in bipartite graphs. It also states corollaries about strong connectivity in directed graphs.

Uploaded by

sahar1344
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Menger’s Theorem for directed graphs

Given x, y ∈ V (D), a set S ⊆ V (D) \ {x, y} is an


x, y-separator (or an x, y-cut) if D − S has no x, y-
path.
Define

κD (x, y) := min{|S| : S is an x, y-cut,} and


λD (x, y) := max{|P| : P is a set of p.i.d. x, y-paths}

Directed-Local-Vertex-Menger Theorem Let x, y ∈


~ 6∈ E(D). Then
V (D), such that xy

κD (x, y) = λD (x, y).

Proof. (Aharoni) Let A = N +(x) and B = N −(y).

D 0 := D − {x, y} − {za
~ : a ∈ A, z ∈ V (D)}
~ : b ∈ B, z ∈ V (D)}
− {bz
D: family of all A, B-paths in D 0.

1
GOAL: Find a family P ⊆ D of pairwise disjoint A, B-
paths and a subset S ⊆ V (D 0) such that
|S ∩ V (P )| ≥ 1 for every P ∈ D and
|S ∩ V (P )| = 1 for every P ∈ P.

Proving the GOAL is indeed enough. (Think it over)

Proof of GOAL. Define an auxiliary bipartite graph H.

V (H) := {v −, v + : v ∈ V (D 0)}
E(H) := {u+v − : uv ∈ E(D 0)} ∪
{v −v + : v ∈ V (D 0) \ A \ B}
By König’s Theorem there is a matching M and a
vertex-cover C in H, such that |e ∩ C| = 1 for every
e ∈ M.

P := {x1 · · · xk ∈ D : x+ −
i i+1 ∈ M for 1 ≤ i < k}.
x
S := {v ∈ V (D 0) : v +, v − ∈ C or v + ∈ A+ ∩ C
or v − ∈ B − ∩ C}.
• Any two paths P1 , P2 ∈ P are disjoint.
V (P1 )∩V (P2 ) 6= ∅ implies there is f1 ∈ E(P1 ),
f2 ∈ E(P2 ) such that f1 6= f2 and f1 ∩ f2 6= ∅.
P1, P2 ∈ P implies that for any fi ∈ E(Pi ) either
f1 = f2 or f1 ∩ f2 = ∅.
• Any A, B-path x0x1x2 · · · xk contains a vertex
from S.
Let i be the largest index such that x−
i ∈ C. (The-
re is such, unless x+ 0 ∈ C and i < k unless
x−
k ∈ C)
Then x+i ∈ C since x + −
i xi+1 must be covered.
• No A, B-path u0u1u2 · · · uk = P ∈ P contains
more than one vertices from S.
Suppose P does contain more. Let ui and uj ∈
S ∩ V (P ) such that uk ∈/ S for i < k < j. Then
u+
i , u −
j ∈ C by definition of S. Let k be the lar-
gest index, i < k < j, such that u+k ∈ C. Then
+
u−
k+1 ∈ C to cover the edge u −
u
k+1 k+1. Hence
edge u+ −
k k+1 ∈ M is covered twice by C, a con-
u
tradiction.
Corollaries

Corollary (Directed-Global-Vertex-Menger Theorem)


A digraph D is strongly k-connected iff for any two
vertices x, y ∈ V (D) there exist k p.i.d. x, y-paths.

Proof: Lemma. For every e ∈ E(D), κD (G−e) ≥ κD (G)−1.

The proof of the very first, the original Menger Theo-


rem (the Undirected-Local-Vertex version) is

HOMEWORK !!!

Derive implication DLVM ⇒ ULVM

2
Directed Edge-Menger

Given x, y ∈ V (D), a set F ⊆ E(D) is an x, y-


disconnecting set if D − F has no x, y-path. Define

κ0D (x, y) := min{|F | : F is an x, y-disconnecting set,}


λ0D (x, y) := max{|P| : P is a set of p.e.d.∗ x, y-paths}

∗ p.e.d. means pairwise edge-disjoint

Directed-Local-Edge-Menger Theorem For all x, y ∈


V (D),
κ0D (x, y) = λ0D (x, y).
Proof. Create directed line graph and apply DLVM.

Corollary (Directed-Global-Edge-Menger Theorem) Di-


rected multigraph D is strongly k-edge-connected iff
there is a set of k p.e.d.x, y-paths for any two vertices
x and y.

You might also like