Material Detail

18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics | Mathematics

18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics | Mathematics

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.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.