MA 216 - Combinatorics

Selected topics from graph theory and enumeration such as isomorphism; planarity; circuits and coloring; search trees and network algorithms. Principles of counting; induction; permutations, combinations, and the binomial theorem; inclusion and exclusion principles; pigeonhole principle; partitions. Additional topics may be chosen from Stirling numbers, generating functions, graph theory, designs, partially ordered sets, codes.

Credits: 3 cr.