| Date | Material Covered | Comments | Corona-Homework | Due date
| | 16 | Chapter 1 (Sections 1.1 and 1.2)
| Notes videos Alternate Link for Videos
| Problem 1.1 of notes.
| Email proofs to me at mhsiggers@knu.ac.kr by March 18 (before midnight!) Please use Subject line: Math 848 HW 1. (It may be a text e-mail or any kind of attachment: pdf, scan, jpg, txt, etc.) |
| 19 | Chapter 2 | | Decide if the degree sequence (5,5,5,3,2,2,1,1) is graphic. | Due March 21 |
| 23 | Chapter 3 (stops before Brook's Theorem) | Video 3a | Math 848 HW 3: Problem 3.3 of notes. | March 25 |
| 26 | Chapter 3 (Brooks Theorem) | Video 3b | Math 848 HW 4: Problem 3.8 of notes. (I said 3.4 in the video, I was working from an old version of the notes.) | March 28 |
| 30 | Sect 4.1, 4.2 | Video 4a | Math 848 HW 5: Problem 4.4 of notes. | Apr 01 |
| Apr 02 | Sect 4.3 | Video 4b | Math 848 HW 6: Problem 4.7 of notes. | Apr 04 |
| 06 | Sect 5.0 | Video 5a | Math 848 HW 7: For Theorem 5.7 show that (v) is equivalent to (one of) the other items. | Apr 08 |
| 09 | Sect 5.1 | Chap5Sect1 | Math 848 HW 8: Problem 5.4 of notes. | Apr 11 |
| 13 | Sect 5.2 | Chap5Sect2 | Math 848 HW 9: Any problem from this section of the notes. | Apr 15. |
| 16 | Sect 6.1 | First half of Chap6 | No homework this class. | |
| 20 | Sect 6.2 | Second half of Chap6 | HW 10: Find the smallest 3 connected graph. | Apr 22 |
| 23 | Homework1-4 | HW1-4 | No homework. |
| 27 | Homework5-10 | HW5-10 | No homework. |
| 30 | 부처님 오신날 | No Class |
| May 04 | Graph Programming | Video: Python.mp4 | HW: Write a program to decide if a graph is a tree.
See Notes for more details. | May 18 |
| 07 | Midterm Preperation | Posted online on Thursday May 07 at 9am (KST) due in May 08 at 9am. |
| 11 | Midterm Test (Chap 1-6) Solutions | Posted online on Monday May 11 at 3pm (KST) due in Thursday May 14 at 3pm.
Note the changed due date. The school has asked for 'sufficient time' for midterm assignments, so I have extended it by two days. |
| 14 | | |
| 18 | Sect 7.1 | Video Chap7Sect1a | No homework. | |
| 21 | Sect 7.1 | Video Chap7Sect1b | HW 11: Problem 7.7 (If a vertex has 0 red edges, they are consecutive.) | May 23 |
| 25 | Sect 7.2 | | HW 12: Problem 7.8 | May 27 |
| 28 | Midterm Solutions | One video per question | | |
| Jun 01 | Sect 8.0, (half of) 8.1 | | HW 13: Problem 8.3 | Jun 03 |
| 04 | Sect 8.1, 8.2 | | HW 14: Problem 8.4 (You don't have to do all colourings, just do one I didn't do in the video.) | Jun 06 |
| 08 | Sect 9.1 | Make sure you use a recent version of the notes. | HW 15: Problem 9.5 | Jun 10 |
| 11 | Sect 9.2 | | HW 16: Problem 9.10 | Jun 13 |
| 15 | Sect 9.3 | | HW 17: Problem 9.24 | Jun 17 |
| 18 | HW10-17 | | No HW this class | |
| 22 | Final Exam in Room 319 (Notice room change.) 3pm-4:15 | Covering Sections 7 - 9 |