everything.study
MATH 566

Combinatorial Theory

3 credits · Undergraduate credit

Permutations, combinations, generating functions, and recurrence relations. The existence and enumeration of finite discrete configurations. Systems of representatives, Ramsey's Theorem, and extremal problems. Construction of combinatorial designs.

Prerequisites & course information

MATH 465. (3). (BS). May not be repeated for credit.

Sources
Catalogue variants