1. Home
  2. Material Detail: 18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics

Material Detail

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

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

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.
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

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

More about this material

Material Type:
Online Course
Date Added to MERLOT:
October 20, 2011
Date Modified in MERLOT:
June 12, 2018
Author:
Submitter:
Sorel Reisman
Primary Audience:
College General Ed, College Lower Division
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Browse...

Disciplines with similar materials as 18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics
People who viewed this also viewed
Other materials like 18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics

Comments

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