# Math 3322: Graph Theory

## General Information

Instructor: Mikhail Lavrov
Location: Mathematics Building 218
Lecture times: 9:05am-9:55am on Monday if your last name begins A-L and on Wednesday if your last name begins M-Z.
Textbook: A First Course in Graph Theory by Chartrand and Zhang, ISBN 0-486-48368-1.
Office hours: Monday 10am-11am and Friday 9am-10am, online via Collaborate Ultra.
D2L page: https://kennesaw.view.usg.edu/d2l/home/2199852.

More information is available on D2L, where I will post the syllabus, homework assignments and solutions, exams, and more. This webpage is primarily for posting recorded lectures.

## Homework and Exams

There will be eight homework assignments, two midterm exams, and one final exam. The dates are marked below, but you can find and submit the assignments on D2L. No part of your grade will depend on coming to class.

## Detailed Schedule

This is my first time teaching this class at KSU, so the schedule may shift around slightly if a section takes more or less time than I expected.

If you are interested in my slides for this class, the links are below. I don't think that these are a good replacement for coming to class or watching the recorded lectures.

My goal is to have all the recordings for each week posted by the beginning of that week.

• Date
Textbook
Recordings
Assignments
• Mon 1/11
1.1 Graphs & Graph Models

• Wed 1/13
1.2 Connected Graphs

• Fri 1/15
1.2 Connected Graphs

• Mon 1/18
No Class

• Wed 1/20
Proof methods review

• Fri 1/22
1.3 Common Classes of Graphs
HW 1 due
• Mon 1/25
Induction review

• Wed 1/27
2.1 The Degree of a Vertex

• Fri 1/29
2.1 The Degree of a Vertex

• Mon 2/1
2.2 Regular Graphs

• Wed 2/3
2.3 Degree Sequences

• Fri 2/5
2.3 Degree Sequences
HW 2 due
• Mon 2/8
3.1 The Definition of Isomorphism

• Wed 2/10
4.1 Bridges

• Fri 2/12
4.2 Trees
HW 3 due
• Mon 2/15
4.2 Trees

• Wed 2/17
4.3 Spanning Trees

• Fri 2/19
Exam 1 (due at 11:59pm)

• Mon 2/22
5.1 Cut vertices

• Wed 2/24
5.2 Blocks

• Fri 2/26
5.3 Connectivity

• Mon 3/1
5.3 Connectivity
HW 4 due
• Wed 3/3
5.4 Menger's Theorems

• Fri 3/5
5.4 Menger's Theorems

• 3/8-3/14
Spring Break: No Class

• Mon 3/15
6.1 Eulerian Graphs

• Wed 3/17
6.1 Eulerian Graphs

• Fri 3/19
6.2 Hamiltonian Graphs
HW 5 due
• Mon 3/22
6.2 Hamiltonian Graphs

• Wed 3/24
7.1 Strong Digraphs

• Fri 3/26
7.1 Strong Digraphs

• Mon 3/29
7.2 Tournaments

• Wed 3/31
7.2 Tournaments

• Fri 4/2
8.1 Matchings
HW 6 due
• Mon 4/5
8.1 Matchings

• Wed 4/7
8.1 Matchings

• Fri 4/9
Exam 2 (due at 11:59pm)

• Mon 4/12
8.2 Factorization

• Wed 4/14
8.2 Factorization

• Fri 4/16
9.1 Planar Graphs

HW 7 due
• Mon 4/19
9.1 Planar Graphs

• Wed 4/21
9.1 Planar Graphs

• Fri 4/23
10.1 The Four Color Problem

• Mon 4/26
10.2 Vertex Coloring

• Wed 4/28
10.2 Vertex Coloring

• Fri 4/30
10.2 Vertex Coloring

HW 8 due
• Mon 5/3
10.3 Edge Coloring

• Wed 5/5
Final Exam (due 5/6 at 11:59pm)