Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

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

        

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

Logo for 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.
Material Type: Online Course
Date Added to MERLOT: October 20, 2011
Date Modified in MERLOT: October 20, 2011
Author:
Submitter: Sorel Reisman

Details

  • Editor Review (not reviewed)
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)

About

Primary Audience:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: unsure
Accessiblity Information Available: unsure
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Connections



QR Code for this Page

Browse in Categories

Discussion

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

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

Return to Top of Page