MATH 6501: Combinatorics and Graph Theory I
Enumerative combinatorics: factorials, binomials and multinomials, Stirling approximation, recursion and generating functions, Catalan numbers. Graph theory: Kuratowksi's theorem, graph coloring, Ramsey theory, matrix-tree theorem, expander graphs. Prereq: Grad standing in Math; or 4581 and 2568; or permission of instructor.
No text required.