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 , and Euler's formula with a face count for .
The graph .
- The complete graph is simple, and it is connected because any two distinct vertices are adjacent.
- It has vertices and, by the number of edges of a complete graph, edges.
- Suppose that is planar. Since , the edge bound for planar graphs gives .
- This contradicts . So is not planar.
The graph .
- Let the complete bipartite graph have parts and with . It has vertices and edges, one for each pair in .
- It is connected. Two vertices in different parts are adjacent. Two vertices in the same part have a common neighbour in the other part.
- Suppose that is planar, and fix a drawing with no crossings. Let be its number of faces.
- By Euler's formula, .
- For a face , let be the number of edge sides that border , where an edge with on both sides counts twice. Each edge has two sides, and each side borders exactly one face. So .
- The boundary of each face is traced by a closed walk of length , since the graph is connected and has an edge.
- The graph is bipartite. Each step of a walk moves between and , so a closed walk takes an even number of steps. Thus each is even.
- Each face borders some edge side, as the graph is connected with an edge, so . A simple graph has no two edges with the same ends. So a boundary walk of length goes along one edge and straight back. This happens only when and both have degree . In every vertex has degree , so this does not happen.
- By Steps 11 and 12, for every face . Hence by Step 9.
- By Step 8, . This contradiction shows that is not planar.
Idea
Euler's formula fixes the number of faces of any drawing, and each face needs enough edges around it. For there are too many edges for the bound . For every face needs at least four edge sides, because the graph has no triangles, and faces would need sides while only 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.
- Binomial coefficient definition
- Bipartite graph definition
- Cardinality of a finite set definition
- Combination definition
- Complete bipartite graph example
- Complete graph example
- Double counting concept
- Element definition
- Factorial definition
- Graph definition
- Planar graph definition
- Proposition concept
- Proof of Pascal's rule from the recursive definition proof
- Set definition
- Walk definition
- Conjunction definition
- Implication definition
- Predicate definition
- Pascal's rule statement
- Empty set object
- Ordered pair definition
- Reachability definition
- Intersection definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Disjoint sets definition
- Proof of the factorial formula for binomial coefficients by induction proof
- Connected graph definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Factorial formula for binomial coefficients statement
- Euler's formula for planar graphs statement
- Function definition
- Proof of the edge bound for planar graphs proof
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Edge bound for planar graphs statement
- Surjective function definition
- Left inverse definition
- Right inverse definition
- Proof that a composition of injections is injective proof
- Proof that a composition of surjections is surjective proof
- Bijective function definition
- Composition of injections is injective statement
- Composition of surjections is surjective statement
- Proof that a function is bijective iff it has a two-sided inverse proof
- Proof of the rule of sum proof
- Bijective iff it has a two-sided inverse statement
- Rule of sum statement
- Proof of the bijection principle proof
- Proof of the complement principle proof
- Bijection principle statement
- Complement principle statement
- Proof of the number of k-element subsets by induction proof
- Number of k-element subsets statement
- Proof of the number of edges of a complete graph proof
- Number of edges of a complete graph statement
- Proof that K5 and K3,3 are not planar proof
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Planar_graph, Euler's formula
- Web https://en.wikipedia.org/wiki/Three_utilities_problem, Unsolvability
About this page
| Tag | 92NKFM9W1C |
|---|---|
| URI | m2://92NKFM9W1C |
| Kind | proof |
| Writing | W0 stub |
| MSC | 05C10 |
| Proves | K5 and K3,3 are not planar |
| Uses | Complete 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 |
| Methods | Proof by contradiction |
| Changed | 4 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.