| Date | Material Covered | Comments
| | Mar 02 | | Notes Videos (For the videos, if you are off campus, your browser will likely complain about a untrusted certificate.) |
| 03 | | |
| 08 | Sect 1.1 of notes. | |
| 10 | Sect 1.2 | |
| 15 | Sect 2 | |
| 17 | Sect 2, Part of 3 | Here are the Zoom recordings. (Password is in the Whatsapp group.)
We disconnected in the middle, so it is in two parts. While anyone is participating online, I will try to post here.
But also, we are working closely from the notes, so please refer to them. |
| 22 | Sect 3. | Think about Problem 3.5. |
| 24 | Section 4.1, most of 4.2. | |
| 29 | Spanning trees: Section 2.2 of West. | |
| 31 | Shortest path and Min Spanning Tree: 2.3 of West. | |
| Apr 05 | | |
| 07 | | Please watch Video 4b on the website; its about Hamilton cycles. |
| 12 | 2.3 of West | |
| 14 | Chap 2 of Deistal. | To statement of Halls theorem. |
| 19 | Midterm Week | Chap 2 of Deistal. |
| 21 | Midterm Week | No Class |
| 26 | Sect 6.2 of Deistal | Ford Fulkerson |
| 28 | Chap 9 of notes | Hand in homework 1. |
| May 03 | Chap 9 | |
| 05 | 어린이날 | No Class |
| 10 | 9.2-9.4 | |
| 12 | 9.5, 11.1 | Hand in by May 24: Give an example of running two passes of Lex-BFS on some other sufficiently large graph (about 10 vertices and 20 edges). For the second pass, use the same initial vertex, and the inverse of the ordering you get from the first pass to break ties.
|
| 17 | 11.1, 11.2 | The homework assignment is just above. |
| 19 | 석가탄신일 | No Class |
| 24 | 11.3, 12.1 | Video in nextcloud folder. (Same password as before, from the Whatsapp group.) |
| 26 | 12.2 | Video at same link as above. |
| Jun 31 | 12.3 | Video at same link. |
| 02 | Other models of random graphs. | Hand in by June 18: When using the bipartite random graph model B(a,b ; p) what is the expected number of edges and the expected number of k-cycles. |
| 07 | Finals Period | |
| 09 | Finals Period | |
| 14 | Finals Period | |
| 16 | Finals Period | |