Combinatorics and Graph Theory

3 credits · Undergraduate credit

Topics in the graph theory part of the course include (if time permits) trees, k-connectivity, Eulerian and Hamiltonian graphs, tournaments, graph coloring, planar graphs, Euler's formula, the 5-Color theorem, Kuratowski's theorem, and the matrix-tree theorem. The second part of the course will deal with topics in the theory of finite partially ordered sets. This will include material about Mobius functions, lattices, simplicial complexes, and matroids.