Essential techniques and topics in two related areas of discrete mathematics. Topics in combinatorics include constrained arrangements and selections, binomial and multinomial coefficients, inclusion-exclusion, the pigeonhole principle, occupancy problems, generating functions, and recurrence relations. Topics in graph theory include structural properties of graphs and trees, graph coloring, planarity, and spanning trees.
Students entering 2012 and after: satisfies the Mathematical and Quantitative Thought distribution requirement.
Mathematics 150 or permission of the instructor. (Fall)