We construct a transient bounded-degree graph no transient subgraph of which embeds in any surface of finite genus. Moreover, we construct a transient, Liouville, bounded-degree, Gromov–hyperbolic graph with trivial ...

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and ...

We prove that the topological cycles of an arbitrary infinite graph together with its topological ends form a matroid. This matroid is, in general, neither finitary nor cofinitary.