Course description:

MA 415G Combinatorics and Graph Theory

A basic course in the theory of counting and
graph theory.
Topics in enumerative combinatorics include:
generating functions,
compositions,
partitions,
Fibonacci numbers,
permutations,
cycle structure of permutations,
permutations statistics,
Stirling numbers of the first and second kind,
Bell numbers,
inclusion-exclusion.
Topics in graph theory include:
Eulerian and Hamiltonian cycles,
matrix tree theorem,
planar graphs and the 4-color theorem,
chromatic polynomial,
Hall's marriage theorem,
stable marriage theorem
Ramsey theory,
electrical networks.

Prereq: MA 322 or MA 213. (Same as CS 415G)