MATH 515 Combinatorics

Basic counting rules. Principle of inclusion and exclusion. Polya Enumeration Theorem. The Pigeonhole Principle and its generalizations. Generating functions; recurrence relations; elements of graph theory. Optimization for graphs and networks. Experimental design. Several applications given. Prerequisite: 248.