MATH 216B: Combinatorial Theory

← 2009-10 2010-11 2011-12 →
changes (lax) changes (strict) ▾ 2012-13 → 2012-13 →

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 332

Prerequisites: MATH 216A

Description: Addresses the solving of combinatorial prob- lems by studying their morphisms (transformations preserving the problem). Covers optimum flow prob- lems. 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.