Euler's Bridge: The following figure is the graph of the city of Konigsburg in 1736 - vertices represent sections of the cities, edges are bridges. An Eulerian path through the graph is a path which moves from vertex to vertex, crossing each edge exactly once. How many ways could World War II bombers have knocked out some of the bridges of Konigsburg such that the Allied victory parade could trace an Eulerian path through the graph? (The order in which the bridges are destroyed matters.)
Solution
The number of ways to destroy bridges to create an Eulerian path depends on ensuring that exactly 0 or 2 vertices have an odd degree. The specific graph of Konigsburg can be analyzed to find the number of such configurations, resulting in 13023 ways.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.