# Graph Theory 101: Why all Non-Planar Graphs Contain K₅ or K₃,₃

## An intuitive explanation of Kuratowski’s Theorem and Wagner’s Theorem, with lots of diagrams!

A planar graph is one that can be drawn in a plane without any edges crossing. For example, the complete graph K₄ is planar, as shown by the “planar embedding” below.