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

Hw due: Dec 1 Problems from Shortest Dir Path Hw NOT due, but must know for Final Exam Problems from Max s-t Flow and Min s-t Cut Final Exam: Dec 15 - Comprehensive; covers everything from Exams 1,2,3, and SP, Max s-t Flow, Min s-t Cut. Here is the Review for Final Exam .

Course Handouts and Other Pertinent Course Stuff

Handout: on Basic Sets . For class on Aug 23. Handout: on 1.2-1.3 . For class on Aug 25-28. Handout: on 1.4-1.5-1.6 . For class on Sept 1 - 8 Handout: on 2.1-2.2 . For class on Sept 11-13 Handout: on Mathematical Induction . For class on Sept 15-18

Handout: on 3.1 Functions, discrete style . For class on Sept 20-25 Handout on: Section 3.2. For class on on Sept 27 - Oct 2 Handout on: Section 3.3. For class on Oct 4-6 Handout on: Section 3.4. For class on Oct 9-11 Handout on: Section 3.5. For class on Oct 11-13

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

Handout 3 on Counting Process - Part 1 . For class on Nov 6 Handout 4 on Counting Process - Part 2 . For class on Nov 10 Handout on: Counting Process - Part B- contd for class on Nov 10. Handout on: Counting Process - Part C for class on Nov 10. Handout on: Counting Process - Part D - Pigeonhole Principle for class on Nov 13.

Handout 5 on Fundamentals of Graph Theory . For class on Nov 15-20 Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour
. For class on Nov 22. 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 22 Section 9 - Shortest Directed Path
For class on Nov 27-29 Handout on : Rationale for the Shortest Directed Path Algorithms
For class on Nov 29

Handout on : Maximum s-t Flow and Minimum s-t Problems
For class on Dec 1 and 6 For class on Handout on : Rationale for the Max s-t Flow and Min s-t Cut Methods
For class on Dec 6

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*
Hw due: Dec 1 Problems from Shortest Dir Path	Hw NOT due, but must know for Final Exam Problems from Max s-t Flow and Min s-t Cut			Final Exam: Dec 15 - Comprehensive; covers everything from Exams 1,2,3, and SP, Max s-t Flow, Min s-t Cut. Here is the Review for Final Exam .
*Course Handouts and Other Pertinent Course Stuff*
Handout: on Basic Sets . For class on Aug 23.	Handout: on 1.2-1.3 . For class on Aug 25-28.	Handout: on 1.4-1.5-1.6 . For class on Sept 1 - 8	Handout: on 2.1-2.2 . For class on Sept 11-13	Handout: on Mathematical Induction . For class on Sept 15-18
Handout: on 3.1 Functions, discrete style . For class on Sept 20-25	Handout on: Section 3.2. For class on on Sept 27 - Oct 2	Handout on: Section 3.3. For class on Oct 4-6	Handout on: Section 3.4. For class on Oct 9-11	Handout on: Section 3.5. For class on Oct 11-13
Handout 2: on The Immortal Boinking Rabbits . For class on Oct 13	Handout on: Section 7.1 part 1 for class on Oct 13, 18, and Section 7.1 part 2 for class on Oct 18-20.	Handout on: Section 7.2 Part 1, Section 7.2 Part 2, Section 7.2 Part 3, for class on Oct 20-25, and Section 7.2 part 4 for class on Oct 30.	Handout on applications of discrete dynamical systems (DDS) . For class on	Example of Solving Recurrence Relations on mathematica For class on (You need this for the hw due on numerical approaches to discrete dynamical systems.)
Handout 3 on Counting Process - Part 1 . For class on Nov 6	Handout 4 on Counting Process - Part 2 . For class on Nov 10	Handout on: Counting Process - Part B- contd for class on Nov 10.	Handout on: Counting Process - Part C for class on Nov 10.	Handout on: Counting Process - Part D - Pigeonhole Principle for class on Nov 13.
Handout 5 on Fundamentals of Graph Theory . For class on Nov 15-20	Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour . For class on Nov 22.	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 22	Section 9 - Shortest Directed Path For class on Nov 27-29	Handout on : Rationale for the Shortest Directed Path Algorithms For class on Nov 29
Handout on : Maximum s-t Flow and Minimum s-t Problems For class on Dec 1 and 6	For class on Handout on : Rationale for the Max s-t Flow and Min s-t Cut Methods For class on Dec 6
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 ,
Acting Vice-Chancellor for Academic Affairs & Dean
& Professor of Mathematics,
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6015
email: pehng@morris.umn.edu

© 1999-2023 by Peh Ng
Last Modified Tuesday, December 05, 2023
Page URL: http://facultypages.morris.umn.edu/~pehng/Ma3411/index.html