MATH 216B: Combinatorial Theory

← 2017-18 2018-19 2019-20 →
← 2012-13 ← 2017-18 changes (lax) changes (strict) ▾

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 399

Prerequisites: MATH 216A

Description: Addresses the solving of combinatorial problems by studying their morphisms (transformations preserving the problem). Covers optimum flow problems. Develops general techniques and work through the solutions of challenging special cases. Particular focus given to utilizing symmetry to systematically reduce a problem.

Derived Information — The following is not part of the official catalog but is computed from catalog data.
Prerequisite graph not available.