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, Project, & 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.)
Project's Handout
The grading guides for the Course Project can be found at: Grading for Report
and Grading for Presentation

Upcoming Due Dates for Assignments or Project, & Upcoming Exam Dates

Project's Presentations on : Dec 5 - see Project's Handout Hw due: Fri Dec 5 - problems from Maximum s-t Flow and Minimum s-t Cut Final Exam : on Fri Dec 12 at 8:30am till 10:30am in class - the exam is comprehensive and covers everything we did in class. There will be questions on the last two section, SP, Max s-t Flow, and Min s-t Cut. Here is the Review for the Final Exam.

Course Handouts and Other Pertinent Course Stuff

Handout: on Basic Sets . For class on Aug 20. Handout: on 1.2-1.3 . For class on Aug 22-25. Handout: on 1.4-1.5-1.6 . For class on Aug 27-29 & Sept 3 Handout: on 2.1-2.2 . For class on Sept 5-10 Handout: on Mathematical Induction and Handout 1 - Problems for Mathematical Induction . For class on Sept 10-15
Handout: on 3.1 Functions, discrete style . For class on Sept 15 - 19 Handout on: Section 3.2. For class on Sept 22-24 Handout on: Section 3.3. For class on Sept 29 - Oct 1 Handout on: Section 3.4. For class on Oct 1-3 Handout on: Section 3.5. For class on Oct 3 - 6

Handout 2: on The Immortal Boinking Rabbits . For class on Oct 8 Handout on: Section 7.1 part 1 for class on Oct 8 Section 7.1 part 2 for class on Oct 10-on zoom Handout on: Section 7.2 Part 1, Section 7.2 Part 2, Section 7.2 Part 3, for class on Oct 10-20, and Section 7.2 part 4 for class on Oct 22 Handout on applications of discrete dynamical systems (DDS) . For class on Oct 24 Example of Solving Recurrence Relations on mathematica For class on Oct 27 (You need this for the hw due on numerical approaches to discrete dynamical systems.)

Handout 3 on Counting Process - Part 1 . For class on Oct 27-29 Handout 4 on Counting Process - Part 2 . For class on Nov 3-5 Handout on: Counting Process - Parts A & B for class on Oct 27-29 Handout on: Counting Process - Part C for class on Nov 3-5. Counting Process - Part D - Pigeonhole Principle for class on Nov 5 - 7.

Handout 5 on Fundamentals of Graph Theory . For class on Nov 7 - 12 Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour
. For class on Nov 12 - 14 Handout 6: Applications of MCST
, MCST-Cluster:
, and Handout 7 (a) : Greedy Algorithm for MCST.
Handout 7 (b) : Constructing Euler Tours from Eulerian graphs
For class on Nov 12 - 17 Section 9 - Shortest Directed Path
For class on Nov 19, & 21 Handout on : Rationale for the Shortest Directed Path Algorithms
For class on Nov 21

Handout on : Maximum s-t Flow and Minimum s-t Problems
For class on Dec 1 & 3

Resources on Discrete & Combinatorial Mathematics

The Discrete Mathematics Project DIMACS, Center for Discrete Mathematics and Theoretical Computer Science Mathematics Archives on Discrete Mathematics

Resources on Open Problems

(And who says mathematics is not fun? )

Open Problem Garden in Graph Theory A few open problems in Graph Theory and Combinatorics A few open problems in Topological Graph Theory

**Table of Contents**
Course Information: Syllabus, Assignments, Project, Due Dates, etc
*Course Syllabus, Project, & 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.)		Project's Handout The grading guides for the Course Project can be found at: Grading for Report and Grading for Presentation
*Upcoming Due Dates for Assignments or Project, & Upcoming Exam Dates*
Project's Presentations on : Dec 5 - see Project's Handout	Hw due: Fri Dec 5 - problems from Maximum s-t Flow and Minimum s-t Cut	Final Exam : on Fri Dec 12 at 8:30am till 10:30am in class - the exam is comprehensive and covers everything we did in class. There will be questions on the last two section, SP, Max s-t Flow, and Min s-t Cut. Here is the Review for the Final Exam.
*Course Handouts and Other Pertinent Course Stuff*
Handout: on Basic Sets . For class on Aug 20.	Handout: on 1.2-1.3 . For class on Aug 22-25.	Handout: on 1.4-1.5-1.6 . For class on Aug 27-29 & Sept 3	Handout: on 2.1-2.2 . For class on Sept 5-10	Handout: on Mathematical Induction and Handout 1 - Problems for Mathematical Induction . For class on Sept 10-15
Handout: on 3.1 Functions, discrete style . For class on Sept 15 - 19	Handout on: Section 3.2. For class on Sept 22-24	Handout on: Section 3.3. For class on Sept 29 - Oct 1	Handout on: Section 3.4. For class on Oct 1-3	Handout on: Section 3.5. For class on Oct 3 - 6
Handout 2: on The Immortal Boinking Rabbits . For class on Oct 8	Handout on: Section 7.1 part 1 for class on Oct 8 Section 7.1 part 2 for class on Oct 10-on zoom	Handout on: Section 7.2 Part 1, Section 7.2 Part 2, Section 7.2 Part 3, for class on Oct 10-20, and Section 7.2 part 4 for class on Oct 22	Handout on applications of discrete dynamical systems (DDS) . For class on Oct 24	Example of Solving Recurrence Relations on mathematica For class on Oct 27 (You need this for the hw due on numerical approaches to discrete dynamical systems.)
Handout 3 on Counting Process - Part 1 . For class on Oct 27-29	Handout 4 on Counting Process - Part 2 . For class on Nov 3-5	Handout on: Counting Process - Parts A & B for class on Oct 27-29	Handout on: Counting Process - Part C for class on Nov 3-5.	Counting Process - Part D - Pigeonhole Principle for class on Nov 5 - 7.
Handout 5 on Fundamentals of Graph Theory . For class on Nov 7 - 12	Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour . For class on Nov 12 - 14	Handout 6: Applications of MCST , MCST-Cluster: , and Handout 7 (a) : Greedy Algorithm for MCST. Handout 7 (b) : Constructing Euler Tours from Eulerian graphs For class on Nov 12 - 17	Section 9 - Shortest Directed Path For class on Nov 19, & 21	Handout on : Rationale for the Shortest Directed Path Algorithms For class on Nov 21
Handout on : Maximum s-t Flow and Minimum s-t Problems For class on Dec 1 & 3
Resources on Discrete & Combinatorial Mathematics
The Discrete Mathematics Project	DIMACS, Center for Discrete Mathematics and Theoretical Computer Science	Mathematics Archives on Discrete Mathematics
Resources on Open Problems (And who says mathematics is not fun? )
Open Problem Garden in Graph Theory	A few open problems in Graph Theory and Combinatorics	A few open problems in Topological Graph Theory

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 ,
Chair, Division of Science and Mathematics,
& Professor of Mathematics,
Math Discipline's Web Janitor
Mathematics Discipline
Division of Science and Mathematics
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6015
email: pehng@morris.umn.edu

© 1999-2025 by Peh Ng
Last Modified Tuesday, April 07, 2026
Page URL: http://facultypages.morris.umn.edu/~pehng/Ma3411/index.html