Problem: Prove that a simple connected planar graph with fewer than 12 vertices has at least one vertex

of degree 4 or less.

Guidelines: Succinctness of Proof (fewer lines better) then tiebreaker of who submits first

Background: Graph Theory is a field of mathematical study where people make “graphs” that consist of
nodes/vertices, edges (lines that connect the nodes/vertices), and faces (enclosed areas by edges). The
picture below demonstrates:

Source: https://www.geeksforgeeks.org/mathematics-graph-theory-basics-set-1/

Where faces would be inside the vertices of ABC, CAFE, and CDE.

More Definitions to Help:

Simple Graph: A graph that has no edges connected to the same vertex
Planar Graph: A graph in which none of the edges crosses over another
Path: Crossing over edges and vertices to get to another edge
Cycle: A Path where you end up at the same vertex

The Planar Handshaking Theorem and Euler’s Formula should help you.