Graph Theory(그래프 이론)

Class Info

Class Number: Math 842
Dates: Mar 5, 2013 - Jun 4, 2013
Room: NS 213-2
Meeting time:
Tuesday 15:00 - 16:15
Thursday 16:30 - 17:45

Purpose: Introduction to Graph Theory
Text:
Reinhard Diestel, Graph Theory, Springer 2010
Links
Textbook online version
Homework

Final Exam: June 11, 15:00 - 17:30, Room NS 213-2

Range of exam: Sections 1.7-8, 2.1-2, 3.1-2 of the textbook.

Syllabus

Week Topics Chapters
1 Graphs and Degrees 1.1-2
2 Paths, Cycles and Connectivity 1.3-4
3 Trees, Forests and Bipartite Graphs 1.5-6
4 Contractions and Minors, Euler Tours 1.7-8
5 Bipartite Matching 2.1
6 Matching in General, 2-Connected Graphs 2.2,3.1
7 Midterm
8 3-Connected Graphs, Menger's Theorem 3.2-3
9 Linkings 3.3,3.5
10 Plane Graphs 4.1-2
11 Kuratowski's Theorem 4.2,4.4
12 Coloring 5.1-2
13 Edge Coloring, Circulations 5.2-3,6.1
14 Ramsey Theory, Hamilton Cycles 9.1,10.1
15 Final Exam

Grading

We will have a mid-term test in April and a final exam in June .
The grades will be accorded the following weights.
Attendance 10%
Mid-term: 40%
Final: 50%

Homework

Assigned every Thursday and due to hand in on Thursday the week after.
Last modified: Sun Jun 9 15:00:00 KST 2013