Introduction to Combinatorics and Its Applications
Download as PDF
Course Description
Topics: graphs, trees (Cayley's Theorem, application to phylogony), eigenvalues, basic enumeration (permutations, Stirling and Bell numbers), recurrences, generating functions, basic asymptotics. Prerequisites: 51 or equivalent.
Grading Basis
ROP - Letter or Credit/No Credit
Min
4
Max
4
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
This course has been approved for the following WAYS
Formal Reasoning (FR)
Programs
MATH108
is a
completion requirement
for:
- (from the following course set: )
- (from the following course set: )