# #8. Packing Complete Bipartite Graphs

(Back to course page.)

Link to Slides · Link to recording

Prompts for discussion:

Here’s the other proof that I think is a little more transparent in its approach to the final claim (it’s also the proof featured on the Wikipedia page for the theorem).

Here’s the OG reference, which has more context on the problem, and a proof involving eigenvalues and determinants, so enjoy looking that up! :slight_smile:

Just to record the question(s) that came up during discussion: can you show that n-1 is always enough? In how many ways can you do it with n-1 parts? What’s the total number of partitions, with any number of (non-empty) parts?