Combinatorial Mathematics
724
724
Counting problems, with an introduction to Polya's theory; Mobius functions; transversal theory; Ramsey's theorem; Sperner's theorem and related results.
Text:
No Text
Prerequisite:
MATH 290 and at least one mathematics course numbered 450 or higher.
Credit Hours:
3
Math 724 is an introduction to enumerative combinatorics. Topics to be covered include basic counting principles, induction and recursion, a little graph theory, partitions and compositions, generating functions, inclusion/exclusion, and Polya-Redfield theory.
(Martin 2017 )
Frequency:
Odd Fall Semesters Only
