New THE MATHEMATICA JOURNAL article:
Every Clutter Is a Tree of Blobs
by GUS WISEMAN
ABSTRACT: 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.
