Combinatorics And Graph Theory

Combinatorics And Graph Theory

Prefix: 
MA
Course Number: 
415G

A basic course in the theory of counting and graph theory. Topics in enumerative combinatorics may include: generating functions, compositions, partitions, Fibonacci numbers, permutations, cycle structure of permutations, permutations statistics, Stirling numbers of the first and second kind, Bell numbers, or inclusion-exclusion. Topics in graph theory may 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, or electrical networks. Prereq: MA 213 or MA 322

Sections

Fall 2017
Section Credits Room Instructor Syllabus
MA 415G-001 3.0 Rm.341 Margaret Readdy
X
Enter your linkblue username.
Enter your linkblue password.
Secure Login

This login is SSL protected

Loading