Graph Theory (Home Work 5)

Danish Sarwr Student#:12217031

9.1.2
a) Show that k 5-e is planar for any edge e of k 5, the resulting
subgraph is planar .

b) Show that k3,3 –e is planar for any edge e of k3,3

We need to show that when an edge remover from k5 , and also need to check the
same is true of k3,3.The complete graph G on a set of n vertices V, denoted by k n,
is a loop-free undirected graph, where for all a,b ϵV , a≠b., there is an edge{a,b}.
A graph G is called a planar if G can be a drawn in the plane with its edges
intersecting only at vertices G.
Hence k5 , k3,3are not planar , but if we removed the edge(a,b) as k5-e, k3,3
–e . we will get a planar subgraph.

9.2.5 Let T be a spanning tree of a connected plane graph G , and let E *={*e
€ E(G*) │e €E(T)} SHOW that T*=G*[E*] is a spanning tree of G*

Let T be a spanning tree of G. Because T has n vertices, it also has n − 1

edges.The complementary dual subgraph C* = (G \ T) ∗ is a spanning tree of G ∗ .
Because C* has f vertices, it also has f − 1 edges. Every edge in G is either an edge
of T or the dual of an edge in C* , but not both. Thus, m = (n − 1) + (f − 1).

9.2.6 A plan Triangulation is a plane graph in which every face has degree
three .Show that every simple plane graph is a spanning subgraph of some
simple plane traingulation (v≥3)

Proof (via Schnyder woods): it suffices to prove the theorem for simple
triangulations. Consider any Schnyder wood of an n-vertex simple 20 triangulation
G with n vertices, m edges, and f faces (including the outer face). The 21 edges of
each color define a rooted tree with n − 2 vertices, and therefore n − 3 edges, and
every interior edges belongs to exactly one such tree. It immediately follows 23
that m = 3(n − 3) + 3 = 3n − 6.
Finally, because every face is a triangle, we have 24 2m = 3f = 6n − 12. We
conclude that n − m + f = n − (3n − 6) + (2n − 4) = 2

9.3.1
a) Show that if G is a connected planar graph with girth k≥3, then e ≤ k(v-
2)/(k-2).

Pretty much any proof about counting vertices or edges in planar graphs starts
with Euler's formula:
V−e+f=2
Where v is the number of vertices, e the number of edges, and f the number of
faces. Or if we use your notation I guess we could call r the number of faces and
have v-e + r =2.

In this case, we also know the girth k . This tells us that in particular, all the
faces have at least k sides. So if we add up the number of sides on each face, we
get at least k r in total. On the other hand, if we add up the number of sides on
each face, we get 2 e, because each edge lies on two faces. (This sort of
double- counting technique is also standard.) So 2v ≥ kr.
We want an inequality without r in it, so eliminate r by replacing it with 2-v+e,
getting
2e ≥k (2−v+e)
which we can rearrange to (v−2)k ≥ (k−2)e, or the inequality you wanted.

e ≤ (v−2)k / k−2.

b) Using (a), show that Petersen graph is a non-planar.

The Petersen graph is an undirected graph with 10 vertices and 15 edges, Any
non-planar graph has as minors either the complete graph or the complete bipartite
graph, but the Petersen graph has both as minors. The minor can be formed by
contracting the edges of a perfect matching, for instance the five short edges in the
first picture.
The minor can be formed by deleting one vertex (for instance the central vertex
of the 3-symmetric drawing) and contracting an edge incident to each neighbor
of the deleted vertex.
The Petersen graph has crossing number 2 and is 1-planar.
The most common and symmetric plane drawing of the Petersen graph, as a
pentagram within a pentagon, has five crossings. However, this is not the best
drawing for minimizing crossings; there exists another drawing (shown in the
figure) with only two crossings. Because it is nonplanar, it has at least one crossing
in any drawing, and if a crossing edge is removed from any drawing it remains
nonplanar and has another crossing; therefore, its crossing number is exactly 2.
Each edge in this drawing is crossed at most once, so the Petersen graph is 1-
planar. On a torus the Petersen graph can be drawn without edge crossings; it
therefore has orientable genus.

9.5.2 Show, using kuratowski’s theorem, that the Petersen graph is non-
planar

Petersen graph has K3,3 as minor. Kuratowski’s Theorem) A graph is planar iff
it does not have K5 or K3,3 as minors. proof We know that if a graph contains K5
or K3, 3 as a minor graph, then it is not planar. It remains to prove that every non-
planar graph contains K5 or K3, 3 as minor.

1. It suffices to prove this only for minimal non- planar graphs.

2. We will show that every minimal non-planar graph with no K5 or K3,3 as
minor must be 3-connected.
3. We then show that every 3-connected graph with no K5 or K3,3 as minor
is planar.

But we started with a non-planar graph. which is Contradiction! So a non-

planar graph must contain K5 or K3,3 as minor graph. We need to show that if a
graph is non-planar then it must contain a K5 or K3,3 as minor graphs.
Let G be the smallest graph in the set of non planar graph which is 3-connected.
Then we prove the contra-positive of statement ”G doesn’t have K5 and K3,3 as
minor and G is non-planar” i.e. ”G is planar or G has K5 or K3,3 as minor”.

1. Case 1 : Let denote N(v) as set of all vertices neighbour to v. Then if

| N(u)∩N(v)| >=3 then G has a K5 a minor. Which is contradiction.
2. 2. Case 2 : Here |N(u)∩N(v)| <= 2 is satisfied but it is also non planar.
Let N(u)=a1,a2,a3,....,an N(v)=b1,b2,b3,. ,bn If the neighbour of u and
v
interleave then G has a K3,3 minor. Which is contradiction
3. 3. Case 3 : If the neighbour of u and v doesn’t interleave and |N(u)∩N(v)|
<= 2 is satisfied then G is planar.
All the cases provide a result contradiction. This proves the theorem.