Instructor: Prof. Linyuan Lu
Office: LC 400I, Email: lu@math.sc.edu
Office hours: Tuesday, Thursday 12:00PM-1:00PM, and by appointment
Lecture time: TTh & 2:50PM- 4:05PM, LC 303B
Credit Hours: 3
Textbook: Graph Theory, (4th or 5th edition) by Reinhard Diestel, Springer-Verlag, Heidelberg, Graduate Texts in Mathematics, Volume 173, ISBN 978-3-642-14278-9 July 2016 (2010, 2005, 2000, 1997).
Overview: This is the second part of the year-long course on graph theory. Last semester we covered chapter 1-5. This semester we will cover the remaining chapters (except Chapter 8) on special topics such as nextwork flows, extremal graph theory, ramsey theory, Hamilton cycles, random graphs, and tree width.
Learning Outcomes: Students will state fundamental concepts and classical theorems in graph theory. They will combine methods learned from this course and practice them at new problems. Students will demonstrate their problem-solving skills through homework and exams.
Subject Material: We shall cover most material in chapters (6-7, 9-12) of the textbook.
Assessment: The assessment consists of homework assigments, a mid-exam and a final project. Homework will normally be assigned every other week. Each homework has 6 problems and you can select any 5 problems to solve. The total score of each homework is 10 points. You get a bonus point if you solve all 6 problems correctly.
Grading: The breakup grades are homework 50%, midterm exam 25%, and final project 25%. Your final grade is based on the percentage as follows.
Grading Scale
| Grading Scale: | 90-100% A |
76-79% C+ |
60-65% D |
86-89% B+ |
70-75% C |
0-59% F |
|
| 80-85% B |
66-69% D+ |
|