MATH 216A: Combinatorial Theory

← 2018-19 2019-20 2020-21 →
← 2010-11 ← 2011-12 changes (lax) changes (strict) ▾

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 409

Prerequisites: CS 111

Description: Addresses the solving of combinatorial problems by studying their morphisms (transformations preserving the problem). Covers optimum path problems and their variants. Develops general techniques and the ability to work through the solutions of challenging special cases. Focuses on 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