This is the third lecture developing the ideas of the randomized Karger's algorithm to solve the min-cut problem. In this lecture we formally shows that Karger's algorithm works, that is, the probability of success returning the min-cut is non-trivial and can be boosted by repeating a polynomial number of trials. The instruction language is English, however, all material, slides, concepts, definitions, illustrations, etc., are all in English.
