Graphs, Part III

Friday October 17


The pigeonhole principle is a simple yet powerful statement that talks about what happens if you try distributing objects into bins. This lecture explores some of its surprising consequences in the realms of graph theory, parties, and puzzles.

File Attachments

Lecture Recording

The complete archive of this quarter's lecture recordings is available on Canvas.

Today's recording will be embedded on this page shortly after lecture.