22.08.2013 Views

Edge-connectivity of undirected and directed hypergraphs

Edge-connectivity of undirected and directed hypergraphs

Edge-connectivity of undirected and directed hypergraphs

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

118 Chapter 7. Combined augmentation <strong>and</strong> orientation<br />

Pro<strong>of</strong>. By Theorem 2.11, it suffices to show that<br />

<br />

pm(X) ≤ |E0| + γ, (7.9)<br />

X∈F<br />

<br />

pm(V − X) ≤ (|F| − 1) (|E0| + γ) (7.10)<br />

X∈F<br />

both hold for every partition F. Note that γ − m(V − X) can be positive for at most<br />

one member <strong>of</strong> a partition, since γ ≤ m(V )/2. Thus (7.9) follows from (1.12), <strong>and</strong> either<br />

(7.2) or (7.1), depending on whether F has such a member or not. The inequality (7.10)<br />

follows from (1.12) <strong>and</strong> (7.3), if F ′ is chosen to consist <strong>of</strong> the members X <strong>of</strong> F for which<br />

γ − m(X) ≤ 0.<br />

By Theorem 2.11, B(pm) is a base polyhedron with integral vertices, <strong>and</strong> any such<br />

vertex x is the vector <strong>of</strong> in-degrees (restricted to V ) <strong>of</strong> an orientation H ′ 0 <strong>of</strong> H ′ 0 satisfying<br />

(7.5)–(7.7).<br />

Let mi(v) be the multiplicity <strong>of</strong> the edge zv in H ′ 0, mo(v) be the multiplicity <strong>of</strong> the edge<br />

vz in H ′ 0, <strong>and</strong> let H0 denote the <strong>directed</strong> hypergraph obtained from H ′ 0 by deleting the<br />

node z. Then mi(X) ≥ p(X)−ϱ H0 (X) <strong>and</strong> mo(V −X) ≥ p(X)−ϱ H0 (X) for every X ⊆ V .<br />

By (1.4) <strong>and</strong> the crossing supermodularity <strong>of</strong> p, the set function q(X) := p(X) − ϱH0 (X)<br />

is crossing supermodular. Theorem 4.7 asserts the existence <strong>of</strong> a <strong>directed</strong> hypergraph<br />

D = (V, A) that covers q, <strong>and</strong> satisfies the degree specifications mi <strong>and</strong> mo. This means<br />

that H0 + D covers p, <strong>and</strong> the <strong>un<strong>directed</strong></strong> hypergraph H that underlies D satisfies the<br />

degree specification m. Theorem 4.7 also ensures that (7.4) is satisfied. Since H0 + D is<br />

an orientation <strong>of</strong> H0 + H, this completes the pro<strong>of</strong> <strong>of</strong> Theorem 7.1.<br />

If the requirement function p is monotone decreasing or symmetric, then the conditions<br />

<strong>of</strong> Theorem 7.1 can be simplified.<br />

Theorem 7.4. Let H0 = (V, E0) be a hypergraph, p : 2 V → Z+ a monotone decreasing or<br />

symmetric non-negative crossing supermodular set function, m : V → Z+ a degree speci-<br />

fication <strong>and</strong> 0 ≤ γ ≤ m(V )/2 an integer. There exists a hypergraph H with γ hyperedges<br />

satisfying the degree-specification m such that H0 + H has an orientation covering p if <strong>and</strong><br />

only if the following hold for every partition F <strong>of</strong> V :<br />

γ ≥ <br />

p(Z) − eH0(F), (7.11)<br />

Z∈F<br />

<br />

min m(V − X) ≥ p(Z) − eH0(F). (7.12)<br />

X∈F<br />

Z∈F

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!