MATH 39A — Introduction to Combinatorics
[ sn ]Prerequisites: COSI 29a or MATH 23b.
Topics include graph theory (trees, planarity, coloring, Eulerian and Hamiltonian cycles), combinatorial optimization (network flows, matching theory), enumeration (permutations and combinations, generating functions, inclusion-exclusion), and extremal combinatorics (pigeonhole principle, Ramsey's theorem). Usually offered every second year.
Mr. Matveev (fall)