Undergraduate Seminar in Discrete Mathematics

Bridges of Konigsberg.

The famous Bridges of Konigsberg Problem: Can you cross all seven bridges over the river in a single trip, arriving back at your starting point and without crossing any bridge twice? In graph theory, this is the same as asking whether there is an Eulerian circuit on a multigraph with four nodes and seven edges. The great Swiss mathematician Leonhard Euler proved in 1736 that the answer is no. (Image courtesy of MIT OpenCourseWare.)


MIT Course Number


As Taught In

Spring 2006



Cite This Course

Course Features

Course Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Daniel Kleitman. 18.304 Undergraduate Seminar in Discrete Mathematics, Spring 2006. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu (Accessed). License: Creative Commons BY-NC-SA

For more information about using these materials and the Creative Commons license, see our Terms of Use.