Algorithmic Graph Theory and Sage [pdf]
David Joyner, Minh Van Nguyen, and David Phillips
Using the Borsuk–Ulam Theorem
Jiří Matoušek
***** electronic version available at the library *****Course website
Graph theory is a universal tool to model many objects, including computer networks, social networks, relationships, and so on. As time goes by, various disciplines in mathematics have come into graph theory and provided fruitful results; algebraic topology is one of them. This course will give a gentle introduction to graph theory and algebraic topology, and we will see how topology solves graph theory problems.
(2% HW)*12 + (24% Midterm)*2 + 28% Final exam
Weekly homework. No quizzes. Starting from HW4, the homework should be type through LaTeX and submitted through CoCalc.
Students with diverse learning styles and needs are welcome in this course. In particular, if you have a disability/health consideration that may require accommodations, please feel free to approach me.
Percentage scores will be converted to letter grades according to the university-wide standard table.
You are expected to attend the classes.
If you miss some course components due illness, accident, family affliction, or religious observances, please talk to me and provide the documentation. In such cases, the course component is excused, and your course score will be calculated by distributing the weight of the missed item(s) across the other course components. Missing components are limited to at most 20%.