 Bramble (graph theory)

In graph theory, a **bramble** is a concept used to describe a certain type of structure in a graph related to covering and dominating sets. Specifically, a bramble is a collection of subsets of vertices that captures the idea of a "tangled" set of vertices that cannot be separated from each other without removing some edges from the graph.