Given a finite vertex set, one can construct every connected spanning hypergraph by first choosing a spanning hypertree, then choosing a blob on each of its edges. Introduction If is a finite vertex set and is a collection of finite subsets (called edges), none of which is a subset of another, we recursively define the … Continue reading Every Clutter Is a Tree of Blobs