Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics's Full Profile
This course serves as an introduction to major topics of modern enumerative and algebraic combinatorics with emphasis on partition identities, young tableaux bijections, spanning trees in graphs, and random generation of combinatorial objects. There is some discussion of various applications and connections to other fields.
Feb 01, 2005
to May 25, 2005
Days of the Week:
Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
- Level of Difficulty: Beginner
- Size: Massive Open Online Course
- Instructor: Prof. Igor Pak
- Cost: Free
- Institution: MIT OCW
About MIT OCW:
MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.
Questions about Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics
Want more info about Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics?
Get free advice from education experts and Noodle community members.
MIT OpenCourseWare (MIT OCW) is an initiative of the Massachusetts Institute of Technology (MIT) to put all of the educational materials from its undergraduate- and graduate-level courses online, partly free and openly available to anyone, anywhere.