MATH 216A: Combinatorial Theory

← 2008-09 2009-10 2010-11 →
← 2008-09 changes (lax) changes (strict) ▾ 2011-12 → 2010-11 →

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 327

Prerequisites: CS 111/MATH 111

Description: Addresses the solving of combinatori- al problems by studying their morphisms (transforma- tions preserving the problem). Covers optimum path problems and their variants. Develops general tech- niques 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.

Serves as a prerequisite for

MATH 216B
Prerequisite graph not available.
Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2019-20 16/25 16/25