Seven Bridges of Königsberg
GPTKB entity
Statements (69)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Mathematics
|
| gptkbp:connected_landmasses |
four
|
| gptkbp:connects |
four land masses
|
| gptkbp:consists_of |
seven bridges
|
| gptkbp:crossing_requirement |
each bridge exactly once
|
| gptkbp:current_status |
no solution exists for the original problem.
|
| gptkbp:depicts |
the problem of finding an Eulerian path
|
| gptkbp:example |
graph traversal problem
|
| gptkbp:has_implications_for |
network theory
|
| gptkbp:has_influenced |
modern mathematics
|
| gptkbp:has_no_solution |
for a walk that crosses each bridge exactly once
|
| gptkbp:historical_significance |
Euler's solution to the problem of traversability
|
| https://www.w3.org/2000/01/rdf-schema#label |
Seven Bridges of Königsberg
|
| gptkbp:illustrated_by |
Euler's paper on the subject
|
| gptkbp:inspired |
graph theory
|
| gptkbp:involves |
graph theory
|
| gptkbp:is_a |
gptkb:Puzzle
mathematical curiosity topological problem mathematical exploration theoretical problem logical problem historical puzzle historical problem historical example Eulerian circuit problem Eulerian graph problem path problem route problem bridging problem connectivity problem famous mathematical problem famous problem historical case study classic problem famous Eulerian problem famous combinatorial problem famous connectivity challenge famous example famous graph theory problem famous historical puzzle famous logical puzzle famous path challenge famous route problem famous topology problem graph problem graph traversal challenge |
| gptkbp:is_a_solution_for |
1736
|
| gptkbp:is_analyzed_in |
combinatorial optimization
|
| gptkbp:is_considered_as |
one of the first problems in topology
a precursor to graph theory |
| gptkbp:is_discussed_in |
mathematical literature
|
| gptkbp:is_explored_in |
gptkb:computer_science
|
| gptkbp:is_part_of |
history of mathematics
|
| gptkbp:is_related_to |
gptkb:Eulerian_path
gptkb:Euler's_formula Königsberg's geography |
| gptkbp:is_studied_in |
discrete mathematics
|
| gptkbp:is_used_in |
algorithm design
mathematics education |
| gptkbp:location |
gptkb:Königsberg
|
| gptkbp:named_after |
gptkb:Königsberg,_Prussia
|
| gptkbp:number_of_bridges |
seven
|
| gptkbp:originated_in |
gptkb:Königsberg
|
| gptkbp:proposed_by |
gptkb:Leonhard_Euler
|
| gptkbp:type_of_graph |
gptkb:Eulerian_path
|
| gptkbp:year_of_euler's_paper |
1736
|
| gptkbp:bfsParent |
gptkb:Leonhard_Euler
|
| gptkbp:bfsLayer |
4
|