- Course Website: people.math.gatech.edu/~hsmith90/4022.html
- Office Hours: Tuesday 9:30-10:30, Friday 11:15-12:30, and by appointment in Skiles 022
- Syllabus
- Text: The text for this course is Introduction to Graph Theory by Douglas West (2nd edition, Prentice Hall 2001).
- Homework:
Each assignment must be accompanied by a Cover Sheet. (Here is the .tex file).
Each homework assignment will be graded based on completeness and correctness. Due dates will be posted here.
- Homework 1 (Sections 1.1 and 1.2) due August 30, 2017 at 10:10am. Don't forget the cover sheet and a staple. For 1.1.27, you should consider a loop to be a cycle of size 1 and two edges with the same endpoints to be a cycle of size 2.
Solutions - Homework 2 (Sections 1.3 and 1.4) due September 8, 2017 at 10:10am.
Solutions - Homework 3 (Sections 2.1 and 2.2) due September 18, 2017 at 10:10am.
Solutions - Homework 4 (Section 3.1) due September 29, 2017 at 10:10am.
Solutions - Homework 5 (Section 3.2 and 3.3) due October 13, 2017 at 10:10am.
Solutions - Homework 6 (Sections 4.1 and 4.2) due October 20, 2017 at 10:10am.
Solutions - Homework 7 (Sections 5.1 and 5.2) due November 3, 2017 at 10:10am.
Solutions - Homework 8 (Sections 6.1) due November 10, 2017 at 10:10am.
Solutions - Homework 9 (Chapter 6) due November 20, 2017 at 10:10am.
Solutions
- Homework 1 (Sections 1.1 and 1.2) due August 30, 2017 at 10:10am. Don't forget the cover sheet and a staple. For 1.1.27, you should consider a loop to be a cycle of size 1 and two edges with the same endpoints to be a cycle of size 2.
- Quizzes:
- Exams:
The (tentative) dates for the three mid-semester exams are as follows. Exam dates will be confirmed one-week prior to the exam.
- Midterm 1. Friday, September 22, 2017.
Exam and Solutions - Midterm 2. Monday, October 23, 2017.
Exam and Solutions
- Midterm 3. Wednesday, November 29, 2017.
Exam and Solutions.
- Final Exam. Monday December 11, 2017, 11:30am - 2:20pm (FIRM!)
There will be a total of 14 categories of exam questions throughout the semester. Exam 1 will contain a problem from each of the first 5 categories. Exam 2 will contain 10 problems (one from each of Categories 1 - 10). Exam 3 will contain 14 problems (one from each of the 14 categories). The Final Exam will again contain 14 problems, one from each of the 14 categories.
Your work for each question will receive one of three letters: "M'' for master, "J'' for journeyman, or "A'' for apprentice. Once you master a problem, then you do not need to solve any more problems in that category on later exams. If you do not master a problem, then you can try another problem from that category on the next exam.
Your overall exam grade will directly correspond to the number of Categories for which you have mastered a problem during or before the final exam. The following table converts problems to points:# Categories Mastered 6 7 8 9 10 11 12 13 14 Exam Mastery Grade 52% 58% 64% 70% 76% 82% 88% 94% 100% - Midterm 1. Friday, September 22, 2017.
- Course grades: Course grades will be weighted by the following distribution:
- 20%: Homework
- 80%: Exam Mastery Grade
Additional notes on graph connectivity. Here's the unit distances proof that we sketched on the last day of class. As an additional resource, Graph Theory with Applications by J. A. Bondy and U. S. R. Murty (North Holland, 1976) is freely available for download.
Updated November 20, 2017.
