Combinatorial Analysis

9 units (3-0-6) | first, second, third terms

A survey of modern combinatorial mathematics, starting with an introduction to graph theory and extremal problems. Flows in networks with combinatorial applications. Counting, recursion, and generating functions. Theory of partitions. (0, 1)-matrices. Partially ordered sets. Latin squares, finite geometries, combinatorial designs, and codes. Algebraic graph theory, graph embedding, and coloring.