Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics
13 votes
Free
|
||||||||||||||||||||||||||||||||||||
![]() |
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. Categories:
Mathematics
Starts :
2005-02-01 |
|||||||||||||||||||||||||||||||||||
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. Similar coursesCourses related to the course subject
|
Let us know when you did the course Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics.

Add the course Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics to My Personal Education Path.

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.
