Lectures related to Handshake Problem: Graph Representation

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.

Covers semi-definite programming and optimization over positive semidefinite cones.

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Covers probabilistic methods in combinatorics, monochromatic edges, 2-colorable graphs, and good 2-colorings.