# Non planarity of K3,3

It says:

The complete bipartite graph K3,3 is not planar, since every drawing of K3,3contains at least one crossing. why? because K3,3 has a cycle which must appear in any plane drawing.

I am not able to get what cycle which must appear in any plane drawing has to do with edge crossing. Can't a cycle appear in plane drawing without crossing edges and thus letting the graph be planar? I must be missing something stupid.

• Hope this help cpe.kmutt.ac.th/~boon/Graph2/Planar.pdf Or here nptel.ac.in/courses/111104026/lecture38.pdf Dec 12, 2015 at 13:42
• When they say "$K_{3, 3}$ is not planar. Why? It has a cycle", they presumably mean "Why? Because of a long proof which we won't explain, but in which the most important step is noticing that it has a cycle". I agree it's a confusing statement. It's clearly not literally true that having a cycle makes you non-planar, in fact, all of the examples of planar graphs that are given on that page have several cycles. Dec 12, 2015 at 16:39
• @JackM What is that long proof? Is it related to proving Euler's formula when graph is not a tree and hence contains cycle (as explained from 3:56 of this video)? If yes, I am not completely clear how these two relate. Dec 12, 2015 at 17:20
• @Mahesha999 I'm sure there are several proofs of the non-planarity of $K_{3,3}$. I may write one up in a day or so if I have the time. Otherwise you can find the proof I'm thinking of in Douglas West's "Introduction To Graph Theory" in the chapter on planar graphs. Dec 12, 2015 at 17:53
• its not that I have not come across any proof of non planarity of $K_{3,3}$. The one I found in Narsingh Deo's book involves first drawing a square/cycle graph $C_4$, then drawing one of its diagonal. Till this it is planar, However to make it $K_{3,3}$, the other diagonal also needs to be drawn. But then saying that it cannot be drawn without edge crossing. Thus $K_{3,3}$ is non planar... Dec 12, 2015 at 18:53

This explanation is wrong. In principle you could prove that $K_{3,3}$ is not planar by enumerating all types of planar embeddings, and show that some paths must cross. If I remember correctly this is the path chosen in some lecture notes, so if you look around you might be able to find this argument. Another route, taken by your lecture notes, is to use Euler's formula.

When your notes say that $K_{3,3}$ isn't planar since it "has a cycle", they were trying to provide you some intuition, not too successfully I reckon. The claim requires a proof which is indeed given later in the notes.

• which proof on that page is concerned with this fact that $K_{3,3}$ is not planar since it has a cycle? Dec 12, 2015 at 14:42
• ...can you please point me to the reference which makes it a bit more intuitive? Dec 12, 2015 at 15:17
• Is it related to proving Euler's formula when graph is not a tree and hence contains cycle (as explained from 3:56 of this video)? If yes, I am not completely clear how these two relate. Dec 12, 2015 at 17:24
• It's a different Euler's formula: $V-E+F=2$. Dec 12, 2015 at 19:54
• The video talks about the same formula: $n-m+r=2$ as can be seen at 6:35. Its just that she uses $n$ for $V$, $m$ for $E$ and $r$ for $F$. Did you mean that the required formula is different from the one explained in the video. If yes which one is that. If no, its not clicking in my head how this formula indicates that the existence of cycle which appears in any plane drawing makes graph non planar. Can you please tell me sir. Dec 13, 2015 at 8:43

In a comment @MithleshUpadhyay links to a document which is part of the book

Graphs
An Introductory Approach
by Robin J. Wilson and John J. Watkins
John Wiley & Sons, Inc. 1990


It seems that the site you are referencing to does cite this book incompletely. Here is the complete text from the book:

On the other hand, the complete bipartite graph $K_{3,3}$ is not planar, since every drawing of it contains at least one crossing. To see why this is, note that $K_{3,3}$ has a cycle of length $6$ (namely, $uavbwcu$) which must appear in any plane drawing as a hexagon (not necessarily regular).
We must now insert the edges $ub$, $vc$, and $wa$. Only one of them can be drawn inside the hexagon, since two or more would cross. Similarly, only one of them can be drawn outside, since two or more would cross.

The paragraph following the picture is missing in the text you read. I think the proof from the original text is completely clear.

If a,b,c,1,2,3 are the vertices of $K_{3,3}$, then in any planar drawing of $K_{3,3}$ the cycle [1a2b3c1] must appear as a cycle.

For example, if it is drawn in the form of a hexagon, then the edge [1,b] will lie either completely inside the hexagon or completely outside it. Assume that the edge [1,b] lies completely inside the hexagon. The edge [2,c] has to be drawn outside the hexagon or else it will intersect the edge [1,b]. Now [3,a] cannot be drawn without intersecting either edge [1,b] or [2,c].

The same argument is valid if edge [1,b] is drawn outside the hexaon.

• I have come across such proof as I have said in the comments to the original question in response to @Jack M. But the original sentence was: because $K_{3,3}$ has a cycle which must appear in any plane drawing. These specific words does not fit in your explanation. I understand the cycle must appear in any plane drawing. And its obvious. If it does not occur, it will be the different graph as circuits are isomorphic invariant.... Dec 13, 2015 at 14:12
• ....However, how existence of particular cycle in every planar embedding makes graph non planar? Is it like that this sentence is itself incorrect and it should be: not all cycles can be drawn without edge crossing Dec 13, 2015 at 14:17
• In ANY planar drawing of K3,3 the edges [1a2b3c1] must appear as a cycle. Because of the existence of this particular cycle, the edges [1,b] [2,c] [3,a] cannot be drawn without any intersection, making the graph non planar Dec 14, 2015 at 12:00
• you make it sound more correct. However the source webpage only says: "$K_{3,3}$ is non planar because it has a cycle which must appear in any plane drawing.". Thats sounds like generalization: "Graph is non planar if it has a cycle which must appear in any plane drawing." It does not add: "certain edges cannot be drawn without any intersection", the way you added: "edges [1,b] [2,c] [3,a] cannot be drawn without any intersection". There can be a planar graph with particular cycle appearing in all plane drawing and no edges crossing. Seems that sentence on source webpage is ill formed. Dec 23, 2015 at 11:59

Maybe this is useful, even if is not the same kind of proof you want.

Every planar graph without cycles of 3 vertices (triangles) should follow this rule (that derives from Euler's rule):

$$m \leq 2n - 4$$

But $$K_{3,3}$$ has:

$$m = 9$$

$$n = 6$$

$$9 \leq 8$$

That's absurd, so $$K_{3,3}$$ is not planar.