This next video in the Networks series for the Further Maths course sees me looking at the interesting topic of Matching and Allocation problems. It really doesn't get more exciting than this. I look at what bipartite graphs and how they can be used to solve matching problems using The Hungarian Algorithm. I also discuss the different types of bipartite graphs; namely, connected and directed. There are some worked examples and all the theory is explained in an easy to understand way.