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

About the Course & Class Resources

Math 3411 Syllabus Math 3411 Hw page. (This is where you will find the updated hw list and due dates.) Final Exam (comprehensive) : Dec 19 at 1:30-3:30pm . Here is a copy of the Review for Finals.

Project's Oral Presentations : in class on Fri Dec 14 Hw due 9am on Dec 13: Problems from Lab Assignment on Applications of dir and undirected graphs . Ford-Fulkerson's Max-Flow Alg; and Handout on Max-st-Flow Problem; For class on Dec 5-7. Hw due Dec 10: Problems from Maximum s-t Flow .

Handout 9 on ; rationale for the SP algorithms For class on Nov 28 - Dec 3. Hw due Dec 5: Problems from shortest directed path . Hw due Nov 28: Problems from CPM. Handout 8 on ; CPM-PERT For class on Nov 19, 21, 26.

Handout 6; applications of MCST handout For class on Nov 12-14. Handout 7; constructing euler tours on eulerian graphs For class on Nov 16. Handout 5; Graph Theory handout For class on Nov 7 - 12; a few of the figures will be completed by you. Handout 4. For class on Oct 29-Nov 7 and for your hw. Handout 3. For class on Oct 26-Nov 5.

Example of Solving Recurrence Relations on mathematica For class on Oct 24-26. (You need this for the hw due on Oct 26.) applications of discrete dynamical systems . For class on Oct 19-24. Handout 2. For class on Oct 8-10. Handout 1. For class on Sep 10-14. A copy of the Course Project ; the report is due on Dec 7, 2007. Copies of the report's evaluation and presentation's evaluation.

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

You are visitor number

since May 8, 2003

Back to Peh's Teaching Page