Pset 1c

Siyuan Song
July 10, 2023

1 Problem 6
(a)

For n = 1,
1 = 1 × (1 + 1)/2
Suppose when n = k,
1 + 2 + 3 + ... + k = k(k + 1)/2
when n = k + 1,

1 + 2 + 3 + ... + k + k + 1 = k(k + 1)/2 + k + 1 = (k + 1)(k/2 + 1)

= (k + 1)(k + 2)/2
which fulfils the original formula.
Thus , for all n ∈ N ,
1 + 2 + 3 + ... + n = n(n + 1)/2

(b)

For n = 1,
1
X
i · 2i = (1 − 1)21+1 + 2 = 2
i=1

If when n = k,
k
X
i · 2i = (k − 1)2k+1 + 2
i=1

then when n = k + 1,
k+1
X
i · 2i = (k − 1)2k+1 + 2 + (k + 1) · 2k+1
i=1

= 2k · 2k+1 + 2 = (k + 1 − 1) ∗ 2k+1+1 + 2

Thus , for all n ∈ N ,

n
X
i · 2i = (n − 1)2n+1 + 2
i=1

1
2 Problem 7
For a disconnected G (V, E), we are able to construct n(not less than 2 ) nonempty induced subgraphs
G1 , G2 , ..., Gn where each of those subgraphs are connected (even if the subgraph only contains a single
vertex).
What we need to prove is in the complement H, ∀H1 , H2 ∈ H , a walk from H1 to H2 can be found.

According to the problem, the graph G and H share the same vertices.

a. If H1 and H2 are in the same subgraph Gk (which means they are connected in G),
we are able to find a vertex H’ out of Gk .
∵ In graph G, there is no edge H1 − Gk or H2 − Gk .
∴ In the complement graph H, there are edges H1 − Gk and H2 − Gk . A walk {H1 , Gk , H2 } exists.

b. If H1 and H2 are not in the same subgraph,

there is no such edge H1 − H2 in graph G.
∴ Edge H1 − H2 exists in graph H. A walk {H1 , H2 } is found.

Therefore, if G is a disconnected graph and H is its complement, ∀H1 , H2 ∈ H , a walk from H1

to H2 can be found, which indicates that H is a connected graph.

3 Problem 8
According to the textbook 4.1, In general, a graph G is called bipartite if the set V (G) can be divided
into two disjoint sets V1 and V2 in such a way that each edge of G connects a vertex from V1 to a
vertex from V2 .

a. Proof of Sufficiency (”If” Part):

Assume a graph G(V,E) is bipartite, the vertices can be devided into subsets V1 and V2 . Assume
the vertices are a1 , a2 , ..., ai in V1 while b1 , b2 , ..., bj in V2 . If we starts with a certain vertex, the odd
length walk end in the opposite set as all the edges connect vertices from one subset to another.
Thus, every cycle must be even-length.

b. Proof of Necessity (”Only If” Part):

Suppose a graph G has no cycles of odd length. We attempt to color this graph using two colors
such that no two adjacent vertices have the same color.

1. Pick an arbitrary vertex, v, and color it with color 1.

2. Then, color all the vertices adjacent to v with color 2.

3. Next, color all the uncolored vertices adjacent to the color 2 vertices with color 1.
4. Repeat this process until all vertices are colored.

If there exists a vertex with the same color as its adjacent vertices, this would create a cycle of
odd length, which contradicts our assumption that the graph has no cycles of odd length. Thus, such
a conflict is non-existent.
Therefore, we are able to color the graph using two colors where no two adjacent vertices share the
same color, which demonstrates that the graph G is bipartite.