MATH 461 B: Combinatorial Theory I

Basic counting techniques and combinatorial objects. Topics may include permutations, sets, multisets, compositions, partitions, graphs, generating functions, the inclusion-exclusion principle, bijective proofs, and recursions. Prerequisite: minimum grade of 2.0 in MATH 334, or minimum grade of 2.0 in MATH 300 and minimum grade of 2.0 in either MATH 136 or MATH 308.