About MATH 5678 A
Paths and trees, connectivity, Eulerian and Hamiltonian cycles, matchings, edge and vertex colorings, planar graphs, Euler's formula and the Four Color Theorem, networks. Prerequisite: Graduate student or Instructor permission.
Notes
Prereqs: MATH 2055; Open to Degree and PACE students
Section Description
This is a first course in graph theory for graduate students or advanced undergraduate students. This course is encouraged for students that are interested in pure mathematics, combinatorics, network analysis and algorithms. We will cover topics such as independent sets, matchings, covering, packings, connectivity, graph coloring, network flows, other topics.
Section Expectation
This course will be offered as a lecture, with time spent in class discussing problems in groups. Students should expect to spend 6-8 hours per week on this course outside of class time, reviewing the material and completing homework problems. The textbook is Diestel's Graph Theory, which is available as a free pdf, inexpensive ebook, or hardcover.
Evaluation
Grades will be based on homework, with plenty of opportunities to improve before the end of the semester.
Important Dates
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
| Last Day to Add | |
|---|---|
| Last Day to Drop | |
| Last Day to Withdraw with 50% Refund | |
| Last Day to Withdraw with 25% Refund | |
| Last Day to Withdraw |
Resources
There are no courses that meet this criteria.
Interest Form
MATH 5678 A is closed to new enrollment.
But we can remind you a few days before the next term opens. You can also see what terms are enrolling currently.