Bestvina and Feighn showed that a morphism S→ T between two simplicial trees that
commutes with the action of a group G can be written as a product of elementary folding …

We study an abstract notion of tree structure which lies at the common core of various tree-
like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested …

We give a self-contained account of the basic theory of median algebras. We explore
notions of betweenness, convexity, walls, duality etc. In this context we include discussion of …

Given a connected graph, in many cases it is possible to construct a structure tree that
provides information about the ends of the graph or its connectivity. For example Stallings' …

This is a short proof of the existence of finite sets of edges in graphs with more than one end,
such that after removing them we obtain two components which are nested with all their …

The study of infinite graphs has many aspects and various connections with other fields.
There are the classical graph theoretic problems in infinite settings (see the survey by …

A group is accessible if there is a G-tree T such that every edge stabilizer is finite and every
vertex stabilizer has at most one end. A group is inaccessible if it is not accessible. In [6] I …

Работа посвящена обзору известных результатов, связанных с исследованиями
дифференцирований в групповых алгебрах, бимодулях и других алгебраических …

We generalise structure tree theory, which is based on removing finitely many edges, to
removing finitely many vertices. This gives a significant generalization of Tutte's tree …

A self-contained account of the theory of structure trees for edge cuts in networks is given.
Applications include a generalisation of the Max-Flow Min-Cut theorem to infinite networks …