Hogar » Seven Bridges of Königsberg

Seven Bridges of Königsberg

1736
  • Leonhard Euler

This is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 laid the foundations of graph theory and prefigured the idea of topology. The problem asked if the seven bridges of the city of Königsberg could all be traversed in a single trip without doubling back, with the trip ending on the same landmass it began.

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 to the mainland, by seven bridges. The problem was to find a walk through the city that would cross each of those bridges once and only once. Euler’s insight was to abstract the problem by stripping away all features except the land masses and the bridges connecting them. He represented each of the four land masses as a point (a vertex) and each bridge as a line (an edge) connecting the vertices. The resulting mathematical structure is a graph. Euler realized that a path traversing each edge exactly once (an Eulerian path) is possible only if the graph is connected and has zero or two vertices of odd degree (degree being the number of edges connected to a vertex). The Königsberg graph had four vertices, all of which had an odd degree (one with degree 5, and three with degree 3). Therefore, Euler proved that such a path was impossible. This solution is considered the first theorem of graph theory and one of the first results in topology, as it does not depend on measurements or specific geometry, but only on the connectivity of the graph.

UNESCO Nomenclature: 1203
– Geometry

Tipo

Abstract System

Disruption

Foundational

Utilización

Widespread Use

Precursors

  • Basic concepts of geometry from Euclid
  • Early combinatorial problems and recreational mathematics

Aplicaciones

  • network routing (e.g., internet traffic, logistics)
  • circuit design
  • genome sequencing
  • operations research
  • social network analysis

Patentes:

ESO

Potential Innovations Ideas

Membresía obligatoria de Professionals (100% free)

Debes ser miembro de Professionals (100% free) para acceder a este contenido.

Únete ahora

¿Ya eres miembro? Accede aquí
Related to: Königsberg, Euler, graph theory, Eulerian path, vertex, edge, topology, network analysis

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *

DISPONIBLE PARA NUEVOS RETOS
Ingeniero Mecánico, Gerente de Proyectos o de I+D
Desarrollo eficaz de productos

Disponible para un nuevo desafío a corto plazo.
Contáctame en LinkedIn
Integración de electrónica de plástico y metal, diseño a coste, GMP, ergonomía, dispositivos y consumibles de volumen medio a alto, industrias reguladas, CE y FDA, CAD, Solidworks, cinturón negro Lean Sigma, ISO 13485 médico

Estamos buscando un nuevo patrocinador

 

¿Su empresa o institución se dedica a la técnica, la ciencia o la investigación?
> Envíanos un mensaje <

Recibe todos los artículos nuevos
Gratuito, sin spam, correo electrónico no distribuido ni revendido.

o puedes obtener tu membresía completa -gratis- para acceder a todo el contenido restringido >aquí<

Historical Context

(if date is unknown or not relevant, e.g. "fluid mechanics", a rounded estimation of its notable emergence is provided)

Related Invention, Innovation & Technical Principles

Scroll al inicio

También te puede interesar