MERLOT - Multimedia Education Resource for Learning and Online Teaching
 
advanced search materials‎|advanced search members‎|search other libraries
Home Communities Learning Materials Member Directory My Profile About Us

Material Detail

Become a Member | Log In

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

Bookmark and Share
 
Location: Go to Material
or Mirror Site
Material Type: Online Course
Date Added to MERLOT: October 20, 2011
Date Modified in MERLOT: October 20, 2011
  [Report Broken Link For This Material]
Author: Prof. Igor Pak 
Submitter : Sorel Reisman
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.
Browse in Categories:
More information about this material:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: unsure
Accessiblity Information Available: unsure
Copyright: unsure
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

About this material:
Peer Reviews (not reviewed)
Workflow status (Not triaged)
Comments (none)
Learning Exercises (none)
Personal Collections (none)
Accessibility Info (none)
 

Add your own:
Write a comment
Create a learning exercise
Add accessibility information
 
Report this as an Inappropriate Material
QR Code for this Page
 
 
home | communities | learning materials | member directory | my profile | about us
MERLOT is a program of the California State University,
in partnership with higher education institutions,
professional societies, and industry.
Copyright 1997-2013 MERLOT
All rights reserved

Content licensed under
Creative Commons
Questions? Email webmaster@merlot.org - FAQ
--%>