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: Fri Dec 6 - Problems from Max s-t Flow and Min s-t Cut Oral Presentations for Project: in-class on Dec 6 Final Exam: on Fri Dec 13 at 8:30am till 10:30am in Sci 4655 - the final exam is comprehensive. Here is the Review for the Final Exam .

Course Handouts and Other Pertinent Course Stuff

Handout: on Basic Sets . For class on Aug 21. Handout: on 1.2-1.3 . For class on Aug 23-26. Handout: on 1.4-1.5-1.6 . For class on Aug 26-28 Handout: on 2.1-2.2 . For class on Aug 30-Sept 6 Handout: on Mathematical Induction and Handout 1 - Problems for Mathematical Induction . For class on Sept 9-13
Handout: on 3.1 Functions, discrete style . For class on Sept 18 - 23 Handout on: Section 3.2. For class on Sept 23-25 Handout on: Section 3.3. For class on Sept 25-27 Handout on: Section 3.4. For class on Oct 2-4 Handout on: Section 3.5. For class on Oct 7

Handout 2: on The Immortal Boinking Rabbits . For class on Oct 9 Handout on: Section 7.1 part 1 for class on Oct 9 Section 7.1 part 2 for class on Oct 11 Handout on: Section 7.2 Part 1, Section 7.2 Part 2, Section 7.2 Part 3, for class on Oct 11-21, and Section 7.2 part 4 for class on Oct 23 Handout on applications of discrete dynamical systems (DDS) . For class on Example of Solving Recurrence Relations on mathematica For class on Oct 25 & 28 (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 30 Handout 4 on Counting Process - Part 2 . For class on Nov 4-8 Handout on: Counting Process - Part B- contd for class on Nov 4-6 Handout on: Counting Process - Part C for class on Nov 6-8. Handout on: Counting Process - Part D - Pigeonhole Principle for class on Nov 8.

Handout 5 on Fundamentals of Graph Theory . For class on Nov 11 - 15 Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour
. For class on Section 9 - Shortest Directed Path
For class on Nov 20, & 22 Handout on : Rationale for the Shortest Directed Path Algorithms
For class on Nov 27 Handout on : Maximum s-t Flow and Minimum s-t Problems
For class on Nov 27, Dec 2 & 4

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: Fri Dec 6 - Problems from Max s-t Flow and Min s-t Cut	Oral Presentations for Project: in-class on Dec 6	Final Exam: on Fri Dec 13 at 8:30am till 10:30am in Sci 4655 - the final exam is comprehensive. Here is the Review for the Final Exam .
*Course Handouts and Other Pertinent Course Stuff*
Handout: on Basic Sets . For class on Aug 21.	Handout: on 1.2-1.3 . For class on Aug 23-26.	Handout: on 1.4-1.5-1.6 . For class on Aug 26-28	Handout: on 2.1-2.2 . For class on Aug 30-Sept 6	Handout: on Mathematical Induction and Handout 1 - Problems for Mathematical Induction . For class on Sept 9-13
Handout: on 3.1 Functions, discrete style . For class on Sept 18 - 23	Handout on: Section 3.2. For class on Sept 23-25	Handout on: Section 3.3. For class on Sept 25-27	Handout on: Section 3.4. For class on Oct 2-4	Handout on: Section 3.5. For class on Oct 7
Handout 2: on The Immortal Boinking Rabbits . For class on Oct 9	Handout on: Section 7.1 part 1 for class on Oct 9 Section 7.1 part 2 for class on Oct 11	Handout on: Section 7.2 Part 1, Section 7.2 Part 2, Section 7.2 Part 3, for class on Oct 11-21, and Section 7.2 part 4 for class on Oct 23	Handout on applications of discrete dynamical systems (DDS) . For class on	Example of Solving Recurrence Relations on mathematica For class on Oct 25 & 28 (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 30	Handout 4 on Counting Process - Part 2 . For class on Nov 4-8	Handout on: Counting Process - Part B- contd for class on Nov 4-6	Handout on: Counting Process - Part C for class on Nov 6-8.	Handout on: Counting Process - Part D - Pigeonhole Principle for class on Nov 8.
Handout 5 on Fundamentals of Graph Theory . For class on Nov 11 - 15	Section 8: Minimum Cost Spanning Tree (MCST) and Euler Tour . For class on	Section 9 - Shortest Directed Path For class on Nov 20, & 22	Handout on : Rationale for the Shortest Directed Path Algorithms For class on Nov 27	Handout on : Maximum s-t Flow and Minimum s-t Problems For class on Nov 27, Dec 2 & 4
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 Thursday, December 12, 2024
Page URL: http://facultypages.morris.umn.edu/~pehng/Ma3411/index.html