Math 3411's Homepage

Welcome to the Home Page of Discrete & Combinatorial Mathematics

Why is 4 the minimum number of colors to color the 48 contiguous states so that no two bordering states share the same color?

Table of Contents

Course Information: Syllabus, Assignments, Project, Due Dates, etc
Course Syllabus & Assignment List for the Course
Math 3411 Syllabus	Math 3411 Hw page. (This is where you will find the updated hw list and due dates.)
Upcoming Due Dates for Assignments or Project, & Upcoming Exam Dates
HW due : on Tue December 6: from Maximum s-t Flow and Minimum s-t Cut .	Course Project : Here is the Project's Handout ; the written report is due on Thur Dec 1, 2011 . You will be evaluated using the following criteria for report , and the project's presentations will be on Thur Dec 8, 2011 ; your oral presentations will be evaluated based on the following criteria for oral presentation .	Final Exam : on Thur Dec 15 from 4pm till 6pm : this finak is comprehensive Here is a copy of the Review for Final Exam
Course Handouts, Project Handout, and Other Pertinent Course Stuff
Handout on Ford and Fulkerson's Algorithm for Maximum s-t Flow. For class on Nov 22 & Dec 1.	Handout on Rationale for Ford-Fulkerson's Algorithm . For class on Dec 1.	Handout on Rationale for SP Algorithms . For class on Nov 17 & 22.	Handout on Dijkstra's and Floyd-Warshall's Algorithms for SP . For class on Nov 17.	Handout 7. For class on Nov 15.
Greedy Algorithm for MCST. For class on Nov 15.	Handout 6. For class on Nov 15.	Handout 5. For class on Nov 8 & 10.	Handout 4. For class on Nov 1.	Handout 3. For class around Oct 27.
Handout on applications of basic Discrete Dynamical Systems . For class on Oct 25.	Handout 2. For class on Oct 6.	Handout 1. For class around Sep 7.	Example of Solving Recurrence Relations on mathematica For class on Oct 25. (You need this for the hw due on numerical approaches to discrete dynamical systems.)	Handout on Discrete Dynamical Systems For class on Oct 25.
Resources on Discrete & Combinatorial Mathematics
The Discrete Mathematics Project	DIMACS, Center for Discrete Mathematics and Theoretical Computer Science	Network Resource for Operations Research	Games on Graph Theory	Mathematics Archives on Discrete Mathematics
GIDEN's Headquarters at Northwestern University	GIDEN (Graphical Implementation Development Environment for Networks) (software for solving optimization problems on graphs).
Resources on Open Problems (And who says mathematics is not fun? )
A few open problems in Graph Theory and Combinatorics	A few open problems in Topological Graph Theory

since May 8, 2003

Back to Peh's Teaching Page

Comments on this page may be sent to pehng@morris.umn.edu

This homepage is maintained by
Peh H. Ng ,
Professor of Mathematics & Math Discipline's Web Janitor
Mathematics Discipline
Division of Science and Mathematics
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6318
email: pehng@morris.umn.edu

© 1999-2009 by Peh Ng
Last Modified Tuesday, November 29, 2011
Page URL: http://www.morris.umn.edu/~pehng/Ma3411/index.html

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.