AI-created image
Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
gptkb:graph gptkb:historical_problem |
| gptkbp:category |
gptkb:recreational_mathematics
gptkb:topology discrete mathematics |
| gptkbp:currentLocation |
gptkb:Kaliningrad
gptkb:Russia |
| gptkbp:famousFor |
origin of graph theory
|
| gptkbp:hasWikidataID |
Q193558
|
| gptkbp:inspiredBy |
graph theory
|
| gptkbp:involves |
gptkb:Pregel_River
seven bridges two islands two riverbanks |
| gptkbp:locatedIn |
gptkb:Königsberg
gptkb:Prussia |
| gptkbp:photo |
File:Konigsberg_bridges.png
|
| gptkbp:publishedIn |
gptkb:Solutio_problematis_ad_geometriam_situs_pertinentis
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path |
| gptkbp:solvedBy |
gptkb:Leonhard_Euler
No, it is not possible |
| gptkbp:solvedInYear |
1736
|
| gptkbp:type |
Is it possible to walk through the city crossing each bridge exactly once?
|
| gptkbp:bfsParent |
gptkb:Königsberg
|
| gptkbp:bfsLayer |
4
|
| https://www.w3.org/2000/01/rdf-schema#label |
Seven Bridges of Königsberg
|