Courses:

Mathematics and Statistics >> Mathematics


For Course Instructors

  • Advertise your course for free
  • Feature your course listing
  • Create course discussion group
  • Link to your course page
  • Increase student enrollment

More Info...>>


Course Info

  • Course Number / Code:
  • 18.315 (Spring 2005) 
  • Course Title:
  • Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics 
  • Course Level:
  • Graduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Mathematics 
  • Course Instructor(s):
  • Prof. Igor Pak 
  • Course Introduction:
  •  


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



    Spring 2005




    Course Highlights


    This course features problems sets in the assignments section, readings, and a complete set of lecture notes.


    Course Description


    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.
     

ACKNOWLEDGEMENT:
This course content is a redistribution of MIT Open Courses. Access to the course materials is free to all users.






© 2017 Coursepedia.com, by Higher Ed Media LLC. All Rights Reserved.