The Seven Bridges Of Konigsberg

  • Thread starter Thread starter sunilkamadolli
  • Start date Start date
  • Tags Tags
    Bridges
AI Thread Summary
The discussion centers on the Seven Bridges of Konigsberg problem, highlighting its classification as an Euler path problem. The first question examines whether one can walk from point B to point A crossing each bridge exactly once, concluding that it is impossible due to the odd degree of the starting and ending points. The second question addresses the minimum number of times to cross a bridge when moving from C to B, with a proposed answer of eight crossings. Participants emphasize the importance of understanding Euler path definitions and conditions for connected multigraphs. The conversation encourages clarity in reasoning and problem-solving approaches related to graph theory.
sunilkamadolli
Messages
41
Reaction score
0
Hello Everyone,

I was trying to solve couple of fun problems. Many of you must have heard about the famous The Seven Bridges Of Konigsberg and how Euler solved the puzzle. You can do a quick google...

Here is a diagram if you want it...
http://www.contracosta.cc.ca.us/math/BridgeGraph.GIF

One of the question is:
1) Can you walk from say point B to point A crossing each bridge exactly once.
Answer - This is an Euler path problem. So question can be thought of as: Is there an Euler path from point B to A. Well, B has 5 degrees and A has 3 degrees so start and end points are odd degree but the other points (namely, C and D) are odd . This violates Euler's path definition. So it is not possible.

Is my reasoning correct? :confused:


2) If I am moving from C to B and I must cross each bridge atleast once. what is the minimum number of times I have to cross a bridge?
Answer - Is tracing with the pencil the best way to do this problem. I got 8.

Please respond as soon as possible. Thank You for your time.
 
Last edited by a moderator:
Physics news on Phys.org
For 1, your conclusion is correct, but your answer is sort-of "fuzzy". I'd answer that question by saying "An Euler path is (you fill in the definition), so this question is asking if there is (...)." Then you can continue by telling what condition is necessary and sufficient for a connected multigraph to have an Euler path. Finally, draw your conclusion by applying that theorem to the particular graph you are dealing with.

For 2, I don't know of any better way. And you already know the answer can't be 7, so if you can show a path crossing 8 edges, what could be better?
 
Kool. Thanks a lot gnome !
 
TL;DR Summary: I came across this question from a Sri Lankan A-level textbook. Question - An ice cube with a length of 10 cm is immersed in water at 0 °C. An observer observes the ice cube from the water, and it seems to be 7.75 cm long. If the refractive index of water is 4/3, find the height of the ice cube immersed in the water. I could not understand how the apparent height of the ice cube in the water depends on the height of the ice cube immersed in the water. Does anyone have an...
Kindly see the attached pdf. My attempt to solve it, is in it. I'm wondering if my solution is right. My idea is this: At any point of time, the ball may be assumed to be at an incline which is at an angle of θ(kindly see both the pics in the pdf file). The value of θ will continuously change and so will the value of friction. I'm not able to figure out, why my solution is wrong, if it is wrong .
Back
Top