Math 2.0

Combinatorics Proof

Proof that K5 and K3,3 are not planar

Builds on Complete graphComplete bipartite graphPlanar graphConnected graphNumber of edges of a complete graphEdge bound for planar graphsEuler's formula for planar graphsBipartite graphWalk

Proof

We use the edge bound for K5K_5, and Euler's formula with a face count for K3,3K_{3,3}.

The graph K5K_5.

  1. The complete graph K5K_5 is simple, and it is connected because any two distinct vertices are adjacent.
  2. It has v=5v = 5 vertices and, by the number of edges of a complete graph, e=(52)=10e = \binom{5}{2} = 10 edges.
  3. Suppose that K5K_5 is planar. Since v=5≥3v = 5 \ge 3, the edge bound for planar graphs gives e≤3⋅5−6=9e \le 3 \cdot 5 - 6 = 9.
  4. This contradicts e=10e = 10. So K5K_5 is not planar.

The graph K3,3K_{3,3}.

  1. Let the complete bipartite graph K3,3K_{3,3} have parts AA and BB with ∣A∣=∣B∣=3\abs{A} = \abs{B} = 3. It has v=6v = 6 vertices and e=3⋅3=9e = 3 \cdot 3 = 9 edges, one for each pair in A×BA \times B.
  2. It is connected. Two vertices in different parts are adjacent. Two vertices in the same part have a common neighbour in the other part.
  3. Suppose that K3,3K_{3,3} is planar, and fix a drawing with no crossings. Let ff be its number of faces.
  4. By Euler's formula, f=2−v+e=2−6+9=5f = 2 - v + e = 2 - 6 + 9 = 5.
  5. For a face FF, let ℓ(F)\ell(F) be the number of edge sides that border FF, where an edge with FF on both sides counts twice. Each edge has two sides, and each side borders exactly one face. So ∑Fℓ(F)=2e=18\sum_F \ell(F) = 2e = 18.
  6. The boundary of each face FF is traced by a closed walk of length ℓ(F)\ell(F), since the graph is connected and has an edge.
  7. The graph K3,3K_{3,3} is bipartite. Each step of a walk moves between AA and BB, so a closed walk takes an even number of steps. Thus each ℓ(F)\ell(F) is even.
  8. Each face borders some edge side, as the graph is connected with an edge, so ℓ(F)≥1\ell(F) \ge 1. A simple graph has no two edges with the same ends. So a boundary walk of length 22 goes along one edge xyxy and straight back. This happens only when xx and yy both have degree 11. In K3,3K_{3,3} every vertex has degree 33, so this does not happen.
  9. By Steps 11 and 12, ℓ(F)≥4\ell(F) \ge 4 for every face FF. Hence 4f≤184f \le 18 by Step 9.
  10. By Step 8, 4f=20>184f = 20 > 18. This contradiction shows that K3,3K_{3,3} is not planar.

Idea

Euler's formula fixes the number of faces of any drawing, and each face needs enough edges around it. For K5K_5 there are too many edges for the bound 3v−63v - 6. For K3,3K_{3,3} every face needs at least four edge sides, because the graph has no triangles, and 55 faces would need 2020 sides while only 1818 exist.

Reading path

To understand this page from the ground up, read these 62 pages in order. The foundations come first. The path takes the proofs Proof of the number of edges of a complete graph, Proof of the number of k-element subsets by induction, Proof that a composition of injections is injective, Proof that a function is bijective iff it has a two-sided inverse, Proof of the complement principle, Proof of Pascal's rule from the recursive definition, Proof that a composition of surjections is surjective, Proof of the edge bound for planar graphs, Proof of the factorial formula for binomial coefficients by induction, Proof of the rule of sum, Proof of the bijection principle.

  1. Binomial coefficient definition
  2. Bipartite graph definition
  3. Cardinality of a finite set definition
  4. Combination definition
  5. Complete bipartite graph example
  6. Complete graph example
  7. Double counting concept
  8. Element definition
  9. Factorial definition
  10. Graph definition
  11. Planar graph definition
  12. Proposition concept
  13. Proof of Pascal's rule from the recursive definition proof
  14. Set definition
  15. Walk definition
  16. Conjunction definition
  17. Implication definition
  18. Predicate definition
  19. Pascal's rule statement
  20. Empty set object
  21. Ordered pair definition
  22. Reachability definition
  23. Intersection definition
  24. Existential quantifier definition
  25. Universal quantifier definition
  26. Cartesian product definition
  27. Disjoint sets definition
  28. Proof of the factorial formula for binomial coefficients by induction proof
  29. Connected graph definition
  30. Subset definition
  31. Uniqueness quantifier definition
  32. Binary relation definition
  33. Factorial formula for binomial coefficients statement
  34. Euler's formula for planar graphs statement
  35. Function definition
  36. Proof of the edge bound for planar graphs proof
  37. Codomain definition
  38. Function composition definition
  39. Identity function definition
  40. Injective function definition
  41. Edge bound for planar graphs statement
  42. Surjective function definition
  43. Left inverse definition
  44. Right inverse definition
  45. Proof that a composition of injections is injective proof
  46. Proof that a composition of surjections is surjective proof
  47. Bijective function definition
  48. Composition of injections is injective statement
  49. Composition of surjections is surjective statement
  50. Proof that a function is bijective iff it has a two-sided inverse proof
  51. Proof of the rule of sum proof
  52. Bijective iff it has a two-sided inverse statement
  53. Rule of sum statement
  54. Proof of the bijection principle proof
  55. Proof of the complement principle proof
  56. Bijection principle statement
  57. Complement principle statement
  58. Proof of the number of k-element subsets by induction proof
  59. Number of k-element subsets statement
  60. Proof of the number of edges of a complete graph proof
  61. Number of edges of a complete graph statement
  62. Proof that K5 and K3,3 are not planar proof

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Planar_graph, Euler's formula
  2. Web https://en.wikipedia.org/wiki/Three_utilities_problem, Unsolvability
About this page
Tag92NKFM9W1C
URIm2://92NKFM9W1C
Kindproof
WritingW0 stub
MSC05C10
ProvesK5 and K3,3 are not planar
UsesComplete graph, Complete bipartite graph, Planar graph, Connected graph, Number of edges of a complete graph, Edge bound for planar graphs, Euler's formula for planar graphs, Bipartite graph, Walk
MethodsProof by contradiction
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.