Instructor: | Gábor Hetyei Office: Fretwell 335F, Phone: 687-1045, E-mail: ghetyei@uncc.edu Office hours: MW 2:00-3:00 pm or by appointment (eventual changes will be announced in class). |
||||||
Text: |
Applied Combinatorics, 6th Edition by Alan Tucker.
ISBN 978-0-470-45838-9. Some information will be available on supplementary handouts, and you can not expext everything told in the lecture to be found in the book. Attendance is mandatory! |
||||||
Prerequisite: | MATH 2164, or consent of the department. | ||||||
Topics: |
Chapter 1: Graph models, isomorphism, edge counting, planar graphs Chapter 2: Euler cycles, graph coloring Chapter 3: Properties of trees, spanning trees Chapter 4: shortest paths, minimum spanning trees, network flows, algorithmic matching. Time permitting, and depending on the interest of the audience, we will also cover some of the following: Hamilton circuits (Ch. 2), search trees, the traveling salesperson problem (Ch. 3), the transportation problem (Ch. 4). |
||||||
Test Dates: |
|
||||||
Homework: |
Homework will be assigned nearly every day, and will be usually collected on
Monday. I will make an effort to regularly post the homework on the webpage
|
||||||
Evaluation: | Grades will be based on: 23% for the homework, 22% for each of the tests, and 33% for the final (22% for the mandatory part, 11% for the optional part). | ||||||
|
MW 5:00 pm - 6:15 pm in Fretwell 306. | ||||||
Homepage: | http://math2.uncc.edu/~ghetyei/courses/3116/index.html |