Graph Theory
Mathematics 428:2 — Fall 2024

Prof. Weibel

Tentative Course Syllabus   (go to homework table)

Week Lecture dates Sections topics
19/3, 9/6 (TF) 1.1-1.4 Definitions, Paths, distance and Examples
29/10, 9/13 2.1-2.5, 3.1-3.2Degree, Degree Sequence, Isomorphism
39/17, 9/20 4.1-4.4Trees and bridges
49/24, 9/27 5.1-5.4Connectivity
510/1, 10/4 6.1-6.3Eulerian and Hamiltonian graphs
610/8, 10/11 7.1-7.3Digraphs and tournaments
610/15, 10/18 Ch. 1-7Review, Midterm
710/22, 10/25 8.1-8.5Factorization and Matchings, Marriage Theorem
810/29, 11/1 9.1-9.4Planar graphs, torus graphs
911/5, 11/8 10.1-10.4Coloring graphs
1011/12, 11/15 11.1--11.2Ramsey Numbers
1111/19, 11/22 Chapters 1-11Review, Midterm
1211/27 (W) TBDNo class Tues, Thanksgiving week
1312/3, 12/6 12.1-12.3Distance
1412/10 13.1-13.5Review
XX12/21(Tues)?? Final Exam (8-11 AM)

Due dateHomework Section/Problems
9/10/09Chapter 1: #1.4, 1.10;  1.12(a-e);  1.24, 1.30
Syllabus in Catalogue: Colorability, connectedness, tournaments, eulerian and hamiltonian paths, orientability, and other topics from the theory of finite linear graphs, with an emphasis on applications chosen from social, biological, computer science, and physical problems.


Return to
Top of page    Last updated: July 2024

Charles Weibel / Fall 2024