Exercise 1688Combinatorics › Graph theoryL1Added 3 Nov 2026
$K_{3,3}$ is not planar
#bipartite#planarity#K33
Statement
Show that is not planar.
Hint
For bipartite planar graphs, (faces have at least edges). Apply Euler's formula.
Show solutionHide solution
Solution
Parameters. : , , bipartite.
Euler. If planar, .
Face bound. Since is bipartite, every cycle has length , so every face has edges. Thus , i.e. , contradiction.
Conclusion. is not planar.