MTH 337
Cmbinatorics/Graphs · 4 credits · Spring 2027
Requirements
Prerequisite: MTH 232
About this course
Arrangements selection and counting methods, generating functions, recurrence relations, the principle of inclusion and exclusion, and the pigeonhole principle. Introduction to graph theory, trees and searching, Eulerian and Hamiltonian Circuits, planar graphs and coloring of graphs, applications to optimization problems such as network flows.
Seat status as of Oct 3, 5:19 AM ET. Seats can change between refreshes.
Chill Rank compares professors using Rate My Professors reviews, from Chill to Brutal. What each rank means