Question

In: Advanced Math

9. Let G be a bipartite graph and r ∈ Z>0. Prove that if G is...

9. Let G be a bipartite graph and r ∈ Z>0. Prove that if G is r-regular, then G has a perfect matching.1

10. Let G be a simple graph. Prove that the connection relation in G is an equivalence relation on V (G)

Solutions

Expert Solution

9)Proof:
To prove this we first state a theorem.
(Hall’s Marriage Theorem) Let G be a bipartite graph with bipartition
(A, B). Then, there is a matching M ⊆ G which covers A if and only if |N(X)| ≥ |X| for
every X ⊆ A.

Let G be a r-regular bipartite graph with bipartition (A, B). Let X ⊆ A and let t be
the number of edges with one end in X. Since every vertex in X has degree r, it follows that
r|X| = t. Similarly, every vertex in N(X) has degree r, so t is less than or equal to r|N(X)|.
It follows that |X| is at most |N(X)|. Thus, by Hall’s Theorem, there is a matching covering
A, or equivalently, every maximum matching covers A. By a similar argument, we find that
every maximum matching covers B, and this completes the proof.

10)Proof:
Theorem: Let G = (V, E) be a graph. Then the connectivity relation
over V is an equivalence relation.
Proof: Consider an arbitrary graph G = (V, E). We will prove that
the connectivity relation over V is refexive, symmetric, and
transitive.
To show that connectivity is refexive, consider any v ∈ V. Then
the singleton path v is a path from v to itself. Therefore, v is
connected to itself, as required.
To show that connectivity is symmetric, consider any x, y ∈ V
where x is connected to y. We need to show that y is connected
to x. Since x is connected to y, there is some path x, v₁, …, vₙ, y
from x to y. Then y, vₙ, …, v₁, x is a path from y back to x, so y is
connected to x.
Finally, to show that connectivity is transitive, let x, y, z ∈ V be
arbitrary nodes where x is connected to y and y is connected to
z. We will prove that x is connected to z. Since x is connected to
y, there is a path x, u₁, …, uₙ, y from x to y. Since y is connected
to z, there is a path y, v₁, …, vₖ, z from y to z. Then the path
x, u₁, …, uₙ, y, v₁, …, vₖ, z goes from x to z. Thus x is connected to z,as required.


Related Solutions

Let G be a bipartite graph and r ∈ Z>0. Prove that if G is r-regular,...
Let G be a bipartite graph and r ∈ Z>0. Prove that if G is r-regular, then G has a perfect matching. HINT:  Use the Marriage Theorem and the Pigeonhole Principle. Recall that G is r-regular means every vertex of G has degree
1) a) Let k ≥  2 and let G be a k-regular bipartite graph. Prove that G...
1) a) Let k ≥  2 and let G be a k-regular bipartite graph. Prove that G has no cut-edge. (Hint: Use the bipartite version of handshaking.) b) Construct a simple, connected, nonbipartite 3-regular graph with a cut-edge. (This shows that the condition “bipartite” really is necessary in (a).) 2) Let F_n be a fan graph and Let a_n = τ(F_n) where τ(F_n) is the number of spanning trees in F_n. Use deletion/contraction to prove that a_n = 3a_n-1 - a_n-2...
1. Let G be a k-regular bipartite graph. Use Corollary 3.1.13 to prove that G can...
1. Let G be a k-regular bipartite graph. Use Corollary 3.1.13 to prove that G can be decomposed into r-factors iff r divides k.
Prove that every bipartite graph G with size m satisfies α prime(G) ≥ m/∆(G).
Prove that every bipartite graph G with size m satisfies α prime(G) ≥ m/∆(G).
Let S ⊆ R and let G be an arbitrary isometry of R . Prove that...
Let S ⊆ R and let G be an arbitrary isometry of R . Prove that the symmetry group of G(S) is isomorphic to the symmetry group of S. Hint: If F is a symmetry of S, what is the corresponding symmetry of G(S)?
Let G be a graph. prove G has a Eulerian trail if and only if G...
Let G be a graph. prove G has a Eulerian trail if and only if G has at most one non-trivial component and at most 2 vertices have odd degree
Let G be a simple graph. Prove that the connection relation in G is an equivalence...
Let G be a simple graph. Prove that the connection relation in G is an equivalence relation on V (G)
Let G be a group. For each x ∈ G and a,b ∈ Z+ a) prove...
Let G be a group. For each x ∈ G and a,b ∈ Z+ a) prove that xa+b = xaxb b) prove that (xa)-1 = x-a c) establish part a) for arbitrary integers a and b in Z (positive, negative or zero)
Let G be a bipartite graph with 107 left vertices and 20 right vertices. Two vertices...
Let G be a bipartite graph with 107 left vertices and 20 right vertices. Two vertices u, v are called twins if the set of neighbors of u equals the set of neighbors of v (triplets, quadruplets etc are defined similarly). Show that G has twins. Bonus: Show that G has triplets. What about quadruplets, etc.?
Let A be incidence matrix of graph G. prove if G has a cycle, then null...
Let A be incidence matrix of graph G. prove if G has a cycle, then null space of transpose of A is not {0} (there exists non-trivial solution of (A^T)y=0)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT