3 problems

Diestel–Müller's connected bramble number conjecture. For every graph $G$,

Diestel–Müller's connected tree-width–bramble duality conjecture. A duality similar to the tree-width duality theorem should hold between connected tree-width and the maximum conne…

Let $G$ be a graph. A bramble in $G$ is a set of pairwise touching connected subsets of $V(G)$, where two subsets touch if they have a vertex in common or $G$ contains an edge betw…