Lectures related to Differentiable Functions and Lagrange Multipliers

Explores functions of class C^p, emphasizing continuity and differentiability properties.

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.