Problem Set 5 with short solutions

MH3600: Knots and surfaces

September 23, 2015

Exercise 1.
Prove that R2 is not homeomorphic to R3 .
Solution 1.
There exist non-planar graphs, i.e., K3,3 , but any graph can be embedded into R3 .
Exercise 2.
Prove that, for any graph G, there is a simple graph homeomorphic to G.
Solution 2.
Put two extra vertices on every edge of G.
Exercise 3.
Prove that the crossing number of K6 is precisely 3.
Solution 3.
First, there is a drawing of K6 with 3 crossings as shown in Figure 1 and thus the crossing number is at
most 3.
Now lets show that it is at least 3, i.e., there is no drawing with 3 crossings.
First method If there were a drawing with 2 crossings, then K6 without 2 edges would be a planar
graph. However, if we remove two edges adjacent to the same vertex, the remaining part contains K5
and, if we remove two edges that do not have common vertices, then the remaining part contains K3,3 .

Figure 1: Drawing of K6 with 3 crossings

1

Second method If there were a drawing with 2 crossings, then claiming these two crossings as new
vertices, we would get a planar graph with 8 vertices, 19 edges, and all cycles of the length at least 3.
Just as in the proof of Kuratowskis Theorem, we would expect 13 faces since 8 19 + 13 = 2, and the
inequality 2 19 3 13, which is not true.
Exercise 4.
Prove that the genus of K8 is at least 2 (in fact, it is exactly 2).
Solution 4.
Suppose that the genus is 1 (we know its not 0 because K6 is not planar). Then there is an embedding of
K8 into the torus and we have
VE+F = 0
Further, since V = 8 and E = 28, we get F = 20. On the other hand, every cycle in K8 has length at least
3 and thus we must have 2E 3F. Substituting the values E = 28 and F = 20, we get the contradiction
56 60.
Exercise 5.
Prove that the graph K9,5 cannot be embedded in the orientable surface of genus 5.
Solution 5.
Suppose that K9,5 can be embedded in the orientable surface of genus 5. Then
V E + F = 8
Further, since V = 14 and E = 45, we get F = 23. On the other hand, every cycle in K9,5 has length at least
4 and thus we must have 2E 4F. Substituting the values E = 45 and F = 23, we get the contradiction
90 92.
Exercise 6.
The surface of a space station consists of 1566 solar panels non-overlapping congruent square cells
and is completely covered with them. Two neighbour cells either share a common edge and two vertices
or just a common vertex.
An expensive joint is used at each vertex to fix all 3, 4, or 5 panels adjacent to it. How many joints are
there?
Solution 6.
Let V be the number of joints, i.e., vertices of the cell decomposition, let E be the number of edges, and
let F be the number of solar panels, i.e., faces. Then we have the following equations:
V E + F = 6 since genus of the surface is 4 as shown in the illustration,
F = 1566 given in the question,
2E = 4F since all faces are squares.
Thus V 2 1566 + 1566 = 6, which gives us V = 1560.

Figure 2: The Petersen graph Exercise 7

Figure 3: The Petersen graph embedded into the Mbius band

Figure 4: The Petersen graph embedded into the torus

Figure 5: The Petersen graph contains K3,3

Exercise 7.
Consider the graph shown in Figure 2 its called the Petersen graph.
1. Prove that it is not planar.
2. Prove that it can be embedded into the Mbius band.
3. Show that its genus is 1.
4. Since it is not planar, Kuratowskis Theorem implies that it has a subspace homeomorphic either to
K5 or to K3,3 . Find such a subspace (sketch it on top of the graphs diagram).
Solution 7.
1. We have V = 10 and E = 15. If the graph is planar, then F = 7 from Eulers Formula. All cycles
have length at least 5 and thus we must have 2E 5F, i.e., 30 35, which is a contradiction.
2. See Figure 3. Here, we rearranged the graph so that it would be easier to understand the embedding.
3. Since the graph is not planar, its genus is at least 1. To show that it is precisely 1, its sufficient to
construct an embedding into the torus. Its shown in Figure 4.
4. As shown in Figure 5, the Petersen graph contains K3,3 . Notice that, although the Petersen graph
looks very similar to K5 , it doesnt contain K5 because the degree of each vertex of K5 is 4 and the
Petersen graph doesnt have vertices of degree 4.

Definition

The girth of a graph G is the minimum number of edges in any cycle in G.

Exercise 8.
Let be G be a planar graph with V vertices, E edges, and at least one cycle (so that the girth of G is
defined). Let ( G ) be the girth of G. Prove that, if ( G ) 3, then
E

( G )
(V 2)
( G ) 2

Solution 8.
The main thing about the ( G ) is that if the graph G is embedded into a sphere, then 2E ( G ) F
just as in the proof of Kuratowskis Theorem.
If the graph is planar, then V E + F = 2 and F = E + 2 V. Further,
2E ( G ) ( E + 2 V )

(2 ( G )) E ( G ) (2 V )
( ( G ) 2) E ( G ) (V 2)
( G )
E
(V 2)
( G ) 2

Exercise 9.
Let G be a graph that can be embedded into a surface S. Suppose that G has V vertices, E edges, at least
one cycle and the girth ( G ) 3. Find an inequality, similar to the one in Exercise 8, on E, V, ( G ), and
(S) that G must satisfy.
Solution 9.
Just like in Exercise 8, if the graph G is embedded into the surface S, then we have 2E ( G ) F. Further,
V E + F = (S) and F = E + (S) V. Finally,
2E ( G ) ( E + (S) V )

(2 ( G )) E ( G ) ((S) V )
(( G ) 2) E ( G ) (V (S))
( G )
E
(V (S))
( G ) 2

Notice that usually (S) 0. The higher the genus of the surface is, the larger is the RHS of the
inequality and hence the surface can accomodate more edges of a graph.
Exercise 10.
The game of Brussels Sprouts is played between two players as follows. First, n small squares are drawn
at some random positions in the plane. Players 1 and 2 make their moves in turn. Each move consists of
a drawing of new small square and joining its two opposite sides by any smooth simple curves with any
two sides of pre-existing squares so that all of the following conditions are satisfied every time during
the game:
1. At most one curve is attached to every side of every square.
2. Curves do not intersect each other and themselves.
3. Curves intersect squares only where their endpoints meet the sides of the squares.
4. Closed squares are disjoint.
For instance, Figure ?? shows a possible initial position and three first moves of the game. The player
who cannot make a valid move loses and his/her opponent wins.
Prove that the result of the game depends neither on the initial position nor on the actual moves
its completely determined by n even if moves are made randomly.
Solution 10.
See the video in NTULearn.
Exercise 11.
Prove the Fivecolour Theorem, i.e., that every map on the sphere is 5-colourable. In other words,
improve the estimate of 6 we obtained in the lecture.
Solution 11.
I dont remember. Google it!