This is a serious introductory course about properties and applications of graphs. We discuss many famous applications (see course announcement) and study graph-theoretic concepts such as paths, Eulerian circuits, trees, distance, matchings, connectivity, network flows, colorings, planarity, and spanning cycles. A primary goal is to improve students' clarity of thought and language when writing proofs in discrete mathematics.
Collaborative study sessions are being held:
Mondays from 7-9PM in 143 Altgeld Hall and Tuesdays from 4-6PM in 347 Altgeld Hall.