MCS-236 schedule

DateReading Topic Due
9/4 Syllabus. What is graph theory?
9/5 1.1 pages 1-6
9/9 Finish 1.1 Sets, relations, colorings
9/10Reread 1.1 Functions, isomorphisms Set 1
9/12 More on section 1.1
9/13 Induction, ex 1.1.10
9/16Mark confusing points of 1.1 Ex 1.1.10, more induction
9/17Read 1.2 Proving 1.1.10 by induction, walks, trails, paths
9/19 Cut vertices and edges Set 2
9/20 Go over set 1
9/23 Bipartite graphs Set 2 rewrite
9/24Finish reading section 1.2 Peer review of set 1, Eulerian circuits
9/26Pages 485-489 (counting) Set 3 hints, start 1.3
9/27Section 1.3 1.3: Extremal problems
9/30 Set 3
10/1 Nobel conference (no class)
10/3
10/4
10/6 Sunday morning problem session
10/7 Exam review
10/8 Exam 1
10/10Set 4#1 Exam solutions, 1.3 graphic sequences
10/11Set 4#2 Finish 1.3, In-class ex
10/14Set 4#3 Top-down induction
10/15Set 4#4 Start 1.4
10/17Set 4#5 Continue 1.4
10/18 Reading break
10/21 Reading break
10/22 Start 2.1
10/24Set 5#1 Max on applications
10/25Set 5#2 Continue 2.1
10/28
10/29Set 5#3
10/31
11/1
11/4
11/5
11/7
11/8
11/10
11/11
11/13
11/14
11/18
11/19
11/21
11/22
11/25
11/26
11/28 Thanksgiving
11/29 Thanksgiving
12/2
12/3
12/5
12/6
12/9
12/10
12/12
12/13
12/17 Final exam 8-10am