When Combinatorics and Flow Networks Intersect

Slides: https://www.unswcpmsoc.com/assets/workshops/programming/2023/Max_flow_workshop_Slides.pdf Lying in the intersection of computer science and mathematics sits a rich area in combinatorics and graph theory. In this 2 hour talk, we attempt to connect some of the central theorems in combinatorics to the more familiar setting of flow networks. The talk will build all of the knowledge from the ground up so no previous knowledge or experience is required to understand the talk! (Sorry about camera blur! I don't know why it was doing that) 00:00 Introduction 01:13 Introduction to Max Flow: Max Flow Algorithms 11:54 Introduction to Max Flow: Max Flow Min Cut Theorem 20:58 The Combinatorial Results 21:35 The Combinatorial Results: Hall's Marriage Theorem 38:08 The Combinatorial Results: Dilworth's Theorem 55:08 The Combinatorial Results: Menger's Theorem