Vertex cuts separating the ends of a graph

29 October 2014
Gareth Wilkes

Dinits, Karzanov and Lomonosov showed that the minimal edge cuts of a finite graph have the structure of a cactus, a tree-like graph constructed from cycles. Evangelidou and Papasoglu extended this to minimal cuts separating the ends of an infinite graph. In this talk we will discuss a similar structure theorem for minimal vertex cuts separating the ends of a graph; these can be encoded by a succulent, a mild generalization of a cactus that is still tree-like.

  • Junior Topology and Group Theory Seminar