[CS502]-Graph Theory and Applications Fall 2022-23

Homework: II
Name: Aditya Mishra RollNo:12040050 email:adityamishra@iitbhilai.ac.in

Collaborators Names: Satish Kumar Oraon

Solution of problem 1. Let us suppose m and n be two vertices of G .Also m ̸= n ̸= v.Since v is a cut vertex of the
graph.On removing v from G we get components of it. There are two possibilities.

Note :G − V is same as G − v This is true if we construct the complement from an empty set. The only differ-
ence between G − V and G is that G contains all edges mn such that m ̸= adjacent(m) in the original graph.In G−
v we remove all the edges incident to v aolong with the vertex.Hence it is true.
Possibility 1 Suppse m and n are the part of two different components of G-V
This means that there is no edge between m and n in the original graph.On taking the complement of graph , there
is an edge between m and n in the complement of G − V .This implies that there exists an edge between m and n in
G − V . Hence there exists a path between m and n in the complement graph which does not pass through v.Thus no
matter we remove v from the complement graph , there exists an edge between m and n .Hence v is not a cut vertex in
the complement of the graph.
Possibility 2, m and n are in the same components of G-V
Let o be any vertex from some other component.Similar to above possibility, there is no edge between m and o in the
original graph G. Similarly there is no edge between n and o in the original graph.Thus when we take G − V ,there
is an edge between m and o in G − V . There is also an edge between n and o in G − V Hence there is also an edge
between m and n in G − v which does not pass through v.Hence even if we remove v from complement graph , there
is an edge between m and n in G − V .
From both possibilities it is clear that G − v is still connected.

Solution of problem 2. PART A

Let
RED =1;
PINK=2;
ORANGE=3
GREEN =4;
Let the ordering be v3 , v4 , v5 , v1 , v2 . This particular ordering results in using 3 colors which is its chromatic number.

1-1
Lecture 1 1-2

v2

v5

v4

v3

v1

PART B
Let
RED =1;
PINK=2;
ORANGE=3
GREEN =4;
For ordering v1,v2,v3,v4,v5,the greedy coloring will result in asssigning 4 colors which is also equal ∆G
v2

v5

v4

v3

v1

Solution of problem 3. Consider a graph G whose χ(G) is k.Let f:V(G) → − [ k] be its proper coloring . Let
v1,v2,v3....vn be the ordering of the vertices of the graph such that f(vi) < f(vj) whenever i<j is true..Let f∗ : V (G)−
→
[ k] be its greedy coloring .
Claim:for each i, f* (vi) ≤ f (vi).
Poof by Induction :
Trivially f* (v1)=1 ≤ f (v1)
Assumption: Claim is true for all values lower than i and f*(vi) is assumed to equal x. The other vertices v1, v2, v3,
Lecture 1 1-3

and vi-1 must have colours 1, 2, and x-1 based on our selection of vertex ordering.Any j must exist where j < i is such
that vj and vi are nearby. It has to be f*(vj) = x-1. By way of induction, f* (vj) ≤ f (vj). According to the chosen
ordering, f(vj) ≤ f (vi)
=⇒ f(vi) ≥ x-1 Given that vi and vj are close to one another and an appropriate colouring is required, f(vi) ≥ x ==
f* (vi) The evidence of the claim is now complete.We may deduce from the assertion that the highest colour that f*
assigns must be at most k, and as a result, f* employs at most k colours. G uses k colours specifically because it is
k-chromatic.

Solution of problem 4. Part A A k partite graph can be used to depict a graph with k coloring. So, using a collection
of 4 partite sets, we represent the graph.
In the construction below ,blue and yellow partite sets contain 3 nodes, where as red and green partite set contains 2
nodes each. Total nodes= 3 + 3 + 2 + 2 = 10
Lemma as discussed in the lecture
The Turan’s graph has the most edges of any k-partite set with n vertices.Hence the below graph is Turans garph with
10 edges on 4 partite set.
Hence Turan’s graph, which has 10 edges and a four-part set represented by 4 colors , is shown below.
Lecture 1 1-4

1 2

5 6

4 3

8 7

10
Lecture 1 1-5

PARTB We create a complete graph with 5 vertices and a clique number of 5.V(G) v1,v2,v3,v4,v5
Following Mycielski construction we get the below graph whose maximum clique number is 5 and its chromatic num-
ber is 6. We add 6 more vertices namely v6,v7,v8,v9,v10,z

The built graph still has clique number 5 in it. This is clear from the way it was built. The collection of vertices
VNEW (v6,v7, v8, v9, and v10) is unconnected at any two points. Additionally, the vertices from the set VNEW are
related to z, and no pairs from the set are connected to one another. The only graph that can contain 6 cliques is one
that has 5 vertices from the original graph VOLD (v1,v2,v3,v4,v5) and 1 vertex from the VNEW. But since each vertex
in the collection VNEW is only linked to four other vertices, this is not feasible.Hence the new graph still has a 5 clique.

With 5 vertices, v1, v2, v3, v4, v5, the full graph will require 5 distinct colours. The remaining five vertices, VNEW,
are linked to any four nodes in the set VOLD. Thus, the colour of the node to which a vertex is not linked may be
applied to each vertex. In this manner, the initial five colours that were used to colour vertices VNEW will be applied
to them.
Every node from the set of 6, 7, 8, 9, and 10 is linked to z. Therefore, z has to be painted with a different colour. Hence
the chromatic number is 6.

v6

v9 v7
v1

v5 v2

v4 v3

v10 v8

Solution of problem 5. Part A

Lecture 1 1-6

Consider G to be k-chromatic. They would be 1,..., k if G were appropriately coloured with k colours. It is unavoidable
that there will always be at least one edge connecting the two distinct colour sets, I and ”j.” If such an edge didn’t exist,
we could combine colours I and ”j” into one colour and colour G correctly using just k-1 colours. Therefore, there
must be at least one edge connecting a vertex of colour I to a vertex of colour ”j” for each combination of colours I
and ”j”. Given that there is at least one edge for each pair of dissimilar colours, the graph G has at least k(K − 1)/2
edges.
Part B
G’s edges and vertices should be removed until we reach the k-critical subgraph H. The chromatic number of H is
k, and the chromatic number of all correct subgraphs of H is less than k. Lemma: Min degree exceeds k-1 if H is a
k-critical graph.The prior lemma makes it clear that min degree(H) >= K − 1.
=⇒ that H has at least k length cycles. Let the longest path P be represented by v1-v2-v3-....vn. The P contains each
and every neighbor of V1 is subset of V . Since any node that is a neighbour of v1 can be added to create a different
longest path if it is not already included.. If vj is the final vertex of P and v1’s neighbour, d(v1 − vj) >= k − 1. We
get the cycle,V1-V2-V3—VJ-V1. If vj is both v1’s neighbour and the last vertex of P, then d(v1 vj) ¿= k 1. The cycle
is: V1-V2-V3—VJ-V1. Therefore, the cycle v1-vj-v1 is at least k long. This is due to the fact that the final neighbour
would still be k even if all of the k-1 neighbours appeared first in the path. v1-v2-v3 —-vk-v1 is therefore at least k
long. Additionally, because each critical graph H is a subgraph of the original graph G, G has at least one cycle of
length k.

Solution of problem 6. PART A

Let k represent the graph’s highest degree. therefore, i, e∆ = k. Every node in a regular graph has the same degree. A
k regular graph hence has maximum Delta = k. And this maximum degree applies to all vertices. Since it is assumed
that the graph is not k regular, at least one vertex must have a degree that is ≤ k. Let’s call such a vertex v.Making a
spanning tree with v as its root, as seen in the image below.

Now, we arrange the vertices so that the furthest node is at the top (maximum distance come at first). Below is an
image showing the ordering.

When this ordering is subjected to the greedy colouring method. We receive a K coloring. This is due to the fact that
the present vertex has a maximum of k-1 neighbours. Every vertex in the layer above, with the exception of the last
vertex, v, has at least one parent. Each vertex, with the exception of v, will thus have at most k-1 vertices on their left.
There will be some 1..k available for usage, thus the maximum number of colours that the greedy will require is k.
The ideal colouring may or may not be less than k since greedy colour does not ensure it. =⇒ χG ≤ ∆G
Lecture 1 1-7

Part B
Keep in mind that omega(G) = alpha(G) (where alpha(H) is the largest independent set in H). Now consider any
suitable k colour in G. There is a clique in BarG for each colour class in G. However, since Ḡ is bipartite, the single
clique in BarG has an edge. As a result, Ḡ has an edge or a single vertex for each colour class in G. A matching M is
also created by the appropriate edges in G since colour classes don’t share vertices, and k = |M | + (n2|M |) = n|M |.
As a result, optimising the matching in Ḡ corresponds to reducing the number of colours in a correct colouring of G.
In light of this, χ(G) is equal to n − maxM atchingBarG = minEdgeCover({BarG). According to the Konnings
theorem, for a bipartite graph, the matching number (or size of a maximum independent edge set) is equal to the vertex
cover number (or size of a minimal vertex cover). Hence χ(G) = minEdgeCover(Ḡ)= α(Ḡ) =ω(G).

Solution of problem 7. We just need to take entire r Partite graphs into account since we can add edges without
increasing the chromatic number as long as two non-adjacent Vertices exist in two different colour classes. In the
setting of a complete r-partite graph with partite sets that differ in size by more than one, we move a vertex v from
the largest class size I to the lowest class size ’j’. The edges that don’t include v remain constant. However, it loses
j neighbours and gains an i-1 neighbour in its new class. Because I − 1 > j, there are more edges. Thus, the Turan
graph is the one with the most edges.