Seminario de Combinatoria y Geometría

¿What is a path?
CNRS, France

Abstract. Menger theorem, König-Egervary theorem, Ford and Fulkerson flow theorem, Dilworth theorem . . . Under certains conditions, the maximum number of disjoint “paths” joining two given “locations” in some network equals the maximum cardinality of a “cut” .
We present a general abstract hypergraph setting for the concept of ”path”, and propose a simple way of unifying and proving all such min-max theorems.

Sala de juntas del departamento de
Ciencias Básicas edificio H,
13 de junio de 2018,
13 : 00 horas.

Seminari CyG Pierre