MATH 6501: Combinatorics and Graph Theory I

October 20, 2013
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.
Credit Hours: 
3.0

Textbook

Title: 
No text required.


To find course availability and times, please visit the Ohio State Course Catalog and Master Schedule.


[pdf] - Some links on this page are to Adobe .pdf files requiring the use of Adobe Reader. If you need these files in a more accessible format, please webmaster@math.osu.edu.