Wed, 29 Oct 2014

16:00 - 17:00
C1

Vertex cuts separating the ends of a graph

Gareth Wilkes
(Oxford)
Abstract

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.

Markovian acyclic directed mixed graphs for discrete data
 Evans, R Richardson, T The Annals of Statistics volume 42 issue 4 1452-1482 (01 Aug 2014)
Less constrained omnigeneous stellarators
 Parra, F Calvo, I Helander, P Landreman, M Nuclear Fusion volume 55 issue 3 033005 (01 Mar 2015)
Subscribe to