A graph is a collection of vertices, joined together by edges. In this course, we will study the sorts of structures that can be encoded in graphs, along with the properties of those graphs. We’ll learn about such classes of graphs as multi-partite, planar, and perfect graphs, and will see applications to such optimization problems as minimum colorings of graphs, maximum matchings in graphs, and network flows.
The Class: Type: lecture
Requirements/Evaluation: evaluation will be based primarily on problem sets and exams
Prerequisites: MATH 200 or MATH 250
Enrollment Preference: Math majors
Distributions: Division III; Quantative/Formal Reasoning;