The Königsberg bridge problem and the friendship theorem

PorJosé A. Alonso

Se ha publicado un artículo de razonamiento formalizado en Isabelle/HOL titulado The Königsberg bridge problem and the friendship theorem.

Su autor es Wenda Li (de la Universidad de Cambridge).

El artículo se ha publicado el 17 de julio en el Archive of Formal Proofs.

Su resumen es

This development provides a formalization of undirected graphs and simple graphs, which are based on Benedikt Nordhoff and Peter Lammich’s simple formalization of labelled directed graphs in the archive. Then, with our formalization of graphs, we show both necessary and sufficient conditions for Eulerian trails and circuits as well as the fact that the Königsberg Bridge Problem does not have a solution. In addition, we show the Friendship Theorem in simple graphs.