Graph Theory (그래프이론)

Class Info Class Number: MATH 848-001 Dates: Mar 16 2020 - Jun 26 2020 Room: NS 313-3 Meeting time: Mon 15:00 - 16:20 (7A) Thu 9:00 - 10:20 (1A) Prof: Mark Siggers Office Hours Text: We will use these class notes. Other references: Diestal's "Graph Theory" and Devos' Class Notes.

Links Class Info

Syllabus

We will spend about a week (one class) on each of the following topics.

• Basics, Degree Sequences
• Eulerian and Hamiltonian Graphs
• Trees
• Connectivity and Menger's Theorem
• Planarity and Kuratowski's Theorem
• Vertex colouring, Brooks' Theorem
• 4-colour problem, List colouring, Thomassen's Five-list-colouring theorem.
• Matchings, Hall's Theorem
• Graph Homomorphisms
• Extremal Graph Theory, Turan's
• Ramsey Theory
• The Probabilistic Method (2 weeks)

Corona-virus related changes

While we are unable to meet in person, I will post class notes on this website, on the Class Information link above. For every class there will be a short assignment that you have to complete, and email to me, as evidence that you have read the class notes. I will also try to post videos presenting the material in the notes. You are welcome to view these instead of reading the notes. These assignments will be each be worth 1/2 a percent of your grade. The grading scheme given below will be adjusted once we get back to normal meetings.

LMS

If you want to contact me, please do not use the LMS system. I cannot access it from my computer, so I will not look at it again. (I didn't look at it before. The department secretary helpfully set it all up for me.) Please e-mail me, phone me, or come to my office and yell under the door. Also, do not go to the LMS system for updated material. I will just have someone copy the links that are already there. Your attendence will be graded by what you send me. If it is tracked through the system, I will just ignore it.

Grading

Grading will be discussed in class, but will depend largely on participation and how much I like you.