Listed in: Mathematics and Statistics, as MATH-280
Ivan Contreras (Section 01)
A graph is a collection of points with edges drawn between them. Graph theory was first introduced by Leonhard Euler in his solution to the Königsberg bridge problem in 1736. Since then, graph theory has become an active area of study in mathematics due both to its wide array of real life applications in biology, chemistry, social sciences and computer networking, and to its interactions with other branches of mathematics.
The course will start with an overview of the fundamental concepts and general results in graph theory, followed by explorations of a variety of topics in graph theory and their applications, including: connectivity, planar graphs, directed graphs, greedy algorithms, matchings, vertex and edge colorings. The course will end with the introduction of a more advanced topic. Four class hours per week.
Requisite: MATH 271 or 272 or consent of the instructor. MATH 220 or other prior experience with mathematical proofs is recommended. Limited to 30 students. Fall semester. Professor Contreras.
How to handle overenrollment: Preference is given to math majors.
Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: Problem sets, In-class group work or exams, Take-home exams, Oral presentations.
Section 01
M 9:00 AM - 9:50 AM SMUD 207
W 9:00 AM - 9:50 AM SMUD 207
F 9:00 AM - 9:50 AM SMUD 207
| ISBN | Title | Publisher | Author(s) | Comment | Book Store | Price |
|---|---|---|---|---|---|---|
| Combinatorics and Graph Theory (2nd Edition) | New York: Springer, 2008 | Harris, John, Jeffry L. Hirst, and Michael Mossinghoff | E-book available | Amherst Books | TBD |
These books are available locally at Amherst Books.