Combinatorics and Graph Theory
MATH 6312
School of Natural Sciences and Mathematics
This course covers theory and applications of combinatorics and graphs, topics from basic counting principles, principle of inclusion and exclusion, permutation statistics, ordinary and exponential generating functions, composition of integers, integer partitions, Stirling numbers of the first kind, q-analogs of binomial and multinomial coefficients, Euler's formula, Hamilton paths, planar graphs, chromatic and Tutte polynomials and algorithms on networks. 3 credit hours.
Prerequisites: Theoretical Concepts of Calculus and Abstract Algebra I is required or instructor consent required.
Offering Frequency: Every two years
Grades: 410
Median GPA: A
Mean GPA: 3.729