Predavatelj: Bretto – Lyon, Francija

From the growth in interest in digital topology and its applications in computer vision, topology on discrete structure has received increasing attention. A topology on vertex set of a graph G is compatible if every induced subgraph of G is connected if and only if its vertex set is connected for the topology. We will study compatible topology on a bipartite graph and we will give some nice properties of these topologies.
Accessibility