User:Dnlobo/Form-finding

Map of Königsberg in Euler's time showing the actual layout of the seven bridges, highlighting the river Pregel and the bridges

Form-finding is a class of optimization problems which involve the determination of the geometrical configuration of a structure.

notable historical problem in mathematics. Its negative resolution by Leonhard Euler in 1735 laid the foundations of graph theory and presaged the idea of topology.

The city of Königsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands which were connected to each other and the mainland by seven bridges.

The problem was to find a walk through the city that would cross each bridge once and only once. The islands could not be reached by any route other than the bridges, and every bridge must have been crossed completely every time (one could not walk half way onto the bridge and then turn around and later cross the other half from the other side).

Euler's analysis

Euler proved that the problem has no solution.

To start with, Euler pointed out that the choice of route inside each landmass is irrelevant. The only important feature of a route is the sequence of bridges crossed. This allowed him to reformulate the problem in abstract terms (laying the foundations of graph theory), eliminating all features except the list of land masses and the bridges connecting them. In modern terms, one replaces each land mass with an abstract "vertex" or node, and each bridge with an abstract connection, an "edge", which only serves to record which pair of vertices (land masses) is connected by that bridge. The resulting mathematical structure is called a graph.

→ →

Since only the connection information is relevant, the shape of pictorial representations of a graph may be distorted in any way without changing the graph itself. Only the existence (or lack) of an edge between each pair of nodes is significant. For example, it does not matter whether the edges drawn are straight or curved, or whether one node is to the left or right of another.

Next, Euler observed that (except at the endpoints of the walk) whenever one enters a vertex by a bridge, one leaves the vertex by a bridge. In other words, during any walk in the graph, the number of times one enters a non-terminal vertex equals the number of times one leaves it. Now if every bridge is traversed exactly once it follows that for each land mass (except possibly for the ones chosen for the start and finish), the number of bridges touching that land mass is even (half of them, in the particular traversal, will be traversed "toward" the landmass, the other half "away" from it). However, all the four land masses in the original problem are touched by an odd number of bridges (one is touched by 5 bridges and the other three by 3). Since at most two land masses can serve as the endpoints of a putative walk, the existence of a walk traversing each bridge once leads to a contradiction.

In modern language, Euler shows that the existence of a walk in a graph which traverses each edge once depends on the degrees of the nodes. The degree of a node is the number of edges touching it. Euler's argument shows that a necessary condition for the walk of the desired form to exist is that the graph be connected and have exactly zero or two nodes of odd degree. This condition turns out also to be sufficient—a result stated by Euler and later proven by Carl Hierholzer. Such a walk is now called an Eulerian path or Euler walk in his honor. Further, if there are nodes of odd degree, all Eulerian paths start at one of them and end at the other. Since the graph corresponding to historical Königsberg has four nodes of odd degree, it cannot have an Eulerian path.

An alternative form of the problem asks for a path that traverses all bridges and also has the same starting and ending point. Such a walk is called an Eulerian circuit or an Euler tour. Such a circuit exists if and only if the graph is connected and there are no nodes of odd degree at all. All Eulerian circuits are also Eulerian paths, but not all paths are also circuits.

Euler's work was presented to the St. Petersburg Academy on August 26, 1735, and published as Solutio problematis ad geometriam situs pertinentis (The solution of a problem relating to the geometry of position) in the journal Commentarii academiae scientiarum Petropolitanae in 1741. It is available in English in The World of Mathematics.

Significance in the history of mathematics

In the history of mathematics, Euler's solution of the Königsberg bridge problem is considered to be the first theorem of graph theory, a subject now generally regarded as a branch of combinatorics. Combinatorial problems of other types had been considered since antiquity.

In addition, Euler's recognition that the key information was the number of bridges and the list of their endpoints (rather than their exact positions) presaged the development of topology. The difference between the actual layout and the graph schematic is a good example of the idea that topology is not concerned with the rigid shape of objects.

Variations

The classic statement of the problem, given above, uses unidentified nodes—that is, they are all alike except for the way in which they are connected. There is a variation in which the nodes are identified—each node is given a unique name or color.

The northern bank of the river is occupied by the Schloß, or castle, of the Blue Prince; the southern by that of the Red Prince. The east bank is home to the Bishop's Kirche, or church; and on the small island in the center is a Gasthaus, or inn.

It is understood that the problems to follow should be taken in order, and begin with a statement of the original problem:

It being customary among the townsmen, after some hours in the Gasthaus, to attempt to walk the bridges, many have returned for more refreshment claiming success. However, none have been able to repeat the feat by the light of day.

8: The Blue Prince, having analyzed the town's bridge system by means of graph theory, concludes that the bridges cannot be walked. He contrives a stealthy plan to build an eighth bridge so that he can begin in the evening at his Schloß, walk the bridges, and end at the Gasthaus to brag of his victory. Of course, he wants the Red Prince to be unable to duplicate the feat from the Red Castle. Where does the Blue Prince build the eighth bridge?

9: The Red Prince, infuriated by his brother's Gordian solution to the problem, wants to build a ninth bridge, enabling him to begin at his Schloß, walk the bridges, and end at the Gasthaus to rub dirt in his brother's face. His brother should then no longer walk the bridges himself. Where does the Red Prince build the ninth bridge?

10: The Bishop has watched this furious bridge-building with dismay. It upsets the town's Weltanschauung and, worse, contributes to excessive drunkenness. He wants to build a tenth bridge that allows all the inhabitants to walk the bridges and return to their own beds. Where does the Bishop build the tenth bridge?

Solutions

The colored graph

The 8th edge

Reduce the city, as before, to a graph. Color each node. As in the classic problem, no Euler walk is possible; coloring does not affect this. All four nodes have an odd number of edges.

8: Euler walks are possible if 2 nodes or fewer have an odd number of edges. If we have 2 nodes with an odd number of edges, the walk must begin at one such node and end at the other. Since there are only 4 nodes in the puzzle, the solution is simple. The walk desired must begin at the blue node and end at the orange node. Thus, a new edge is drawn between the other two nodes. Since they each formerly had an odd number of edges, they must now have an even number of edges, fulfilling all conditions. This is a change in parity from an odd to even degree.

The 9th edge

The 10th edge

9: The 9th bridge is easy once the 8th is solved. The desire is to enable the red castle and forbid the blue castle as a starting point; the orange node remains the end of the walk and the white node is unaffected. To change the parity of both red and blue nodes, draw a new edge between them.

10: The 10th bridge takes us in a slightly different direction. The Bishop wishes every citizen to return to his starting point. This is an Euler cycle and requires that all nodes be of even degree. After the solution of the 9th bridge, the red and the orange nodes have odd degree, so their parity must be changed by adding a new edge between them.

8th, 9th, and 10th bridges

Present state of the bridges

Two of the seven original bridges were destroyed during the bombing of Königsberg in World War II. Two others were later demolished and replaced by a modern highway. The three other bridges remain, although only two of them are from Euler's time (one was rebuilt in 1935). Thus, there are now five bridges in Königsberg.

In terms of graph theory, two of the nodes now have degree 2, and the other two have degree 3. Therefore, an Eulerian path is now possible, but since it must begin on one island and end on the other, it is impractical for tourists.

At Canterbury University, in Christchurch, New Zealand, a model of the bridges is incorporated in a grass area between the old Physical Sciences Library and the Erskine Building, Housing the Departments of Mathematics, Statistics and Computer Science.

See also

• Glossary of graph theory
• Icosian game
• Hamiltonian path
• Water, gas, and electricity
• Travelling salesman problem

External links

• Kaliningrad and the Konigsberg Bridge Problem at Convergence
• Euler's original publication (in Latin)
• The Bridges of Königsberg
• How the bridges of Königsberg help to understand the brain
• Euler's Königsberg's Bridges Problem at Math Dept. Contra Costa College
• Pregel - A Google graphing tool named after this problem