Introduction to proof and discrete mathematics

Planar and bipartite graphs

Euler's formula for a plane drawing, the edge bound that follows from counting incidences two ways, and the odd cycle that decides whether a graph is bipartite.

About 25 minutes6 activities Paper packet