Math 3322: Graph Theory (Fall 2023)
General Information
Instructor: Mikhail Lavrov
Location: Architecture 174
Lecture times: 3:30pm to 4:45pm on Monday and Wednesday
Office hours: 3:30pm to 5:30pm on Thursday in my office, Mathematics 245, or by appointment.
D2L page: https://kennesaw.view.usg.edu/d2l/home/2974260.
D2L will be used to submit assignments (these will be posted both here and on D2L, for convenience) and to view grades. The syllabus will also be posted there.
During the scheduled office hours, you should feel free to show up with no notice if you have questions of any kind. These are joint office hours for both classes I'm teaching. If you have the flexibility, I would prefer graph theory questions in the first hour, 3:30pm-4:30pm; if not, either hour is fine.
If you cannot make the scheduled office hours, begin by emailing me; if your questions are easy to answer by email, I will do that, and if not, we can find another time to meet. (Allow some time for me to check my email.)
Homework and Exams
There will be eight homework assignments, two midterm exams, and one final exam; the dates are marked below.
I will post the homework assignments here and on D2L; they are always due on Friday at 11:59pm, via D2L.
Exams will be given in person during our ordinary 75-minute class period.
Textbooks
There is no official textbook for this course. I will publish lecture notes on this page before each class; all the material covered will be in those lecture notes.
If you would like additional references, I recommend the following:
- Chartrand and Zhang, A First Course in Graph Theory. This textbook is used by many other sections of Math 3322 (so some of you may already have it); it is also an inexpensive paperback.
- West, Introduction to Graph Theory. This is a very comprehensive resource, going into much more detail than we will on many topics. If you are reading it, read it slowly and carefully: a single page often corresponds to 10-15 minutes of class time!
Detailed Schedule
I will use the labels CZ and W to indicate which sections of the textbooks I mentioned above will correspond to which day of class. (We might not always cover everything in those sections, especially in W.)
If you are looking for the lecture notes originally found on this page, I have removed them because I've posted new and improved lecture notes on the page for fall 2024 instead.
-
DateTopic CoveredOther details
-
Mon 8/14Introduction to graphsCZ 1.1, W 1.1
-
Wed 8/16Connected componentsCZ 1.2, W 1.2
-
Mon 8/21Proof techniquesW App. 3
-
Wed 8/23Types of graphsCZ 1.3, W 1.1-1.2
HW 1 due Friday -
Mon 8/28Proofs by inductionW App. 3
-
Wed 8/30The degree of a vertexCZ 2.1, W 1.3
-
Mon 9/4No class
-
Wed 9/6Regular graphsCZ 2.2, W 1.3
HW 2 due Friday -
Mon 9/11Graphic sequencesCZ 2.3, W 1.3
-
Wed 9/13Isomorphic graphsCZ 3.1, W 1.1
-
Mon 9/18Trees and spanning treesCZ 4.1, W 2.1
-
Wed 9/20Properties of treesCZ 4.2, W 2.1
HW 3 due Friday -
Mon 9/25Cayley's formulaCZ 4.4, W 2.2
-
Wed 9/27Exam 1
-
Mon 10/2Bipartite matchingsCZ 8.1, W 3.1
-
Wed 10/4König's theoremW 3.1-3.2
HW 4 due Friday -
Mon 10/9Matchings in general graphsCZ 8.1, W 3.3
-
Wed 10/11Digraphs and multigraphsCZ 7.1, W 1.4
-
Mon 10/16Eulerian graphsCZ 6.1, W 1.2
-
Wed 10/18Hamiltonian graphsCZ 6.2, W 7.2
HW 5 due Friday -
Mon 10/23TournamentsCZ 7.2, W 1.4
-
Wed 10/25Planar graphsCZ 9.1, W 6.1
-
Mon 10/30Planarity testingCZ 9.1, W 6.2
-
Wed 11/1PolyhedraW 6.1
HW 6 due Friday -
Mon 11/6Cliques and independent setsW 3.1, 5.1
-
Wed 11/8Exam 2
-
Mon 11/13Vertex coloringCZ 10.2, W 5.1
-
Wed 11/15Bounds on chromatic numberW 5.1
HW 7 due Friday -
Mon 11/20No class
-
Wed 11/22No class
-
Mon 11/27Cut verticesCZ 5.1, W 4.1
-
Wed 11/29k-connectivityCZ 5.3, W 4.2
-
Mon 12/4Menger's theoremCZ 5.4, W 4.2
HW8 due Monday -
Wed 12/6No class
-
Mon 12/11Final exam (3:30pm to 5:30pm)