Courses > Mathematics > Undergraduate Seminar in Discrete Mathematics Email this page18.304 Undergraduate Seminar in Discrete Mathematics
Courses > Mathematics > Undergraduate Seminar in Discrete Mathematics 18.304 Undergraduate Seminar in Discrete MathematicsSpring 2006
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 by MIT OCW.)
Course DescriptionThis 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.
Courses > Mathematics > Undergraduate Seminar in Discrete Mathematics Download this Course18-304Spring-2006.zip (ZIP - 1.70 MB) Click the link above to start downloading this course. You may need to download file decompression software such as WinZip or StuffIt to open the .ZIP file. For more information about downloading and using zipped courses, read our Frequently Asked Questions. All of the Materials included in the .ZIP file are governed by the same Creative Commons license that governs use of materials published on the MIT OCW page. |

See all the reviews