Graphical Representations of Clutters

Abstract

We discuss the use of $K$-terminal networks to represent arbitrary clutters. A given clutter has many different representations, and there does not seem to be any set of simple transformations that can be used to transform one representation of a clutter into any other. We observe that for $t\ge 2$ the class of clutters that can be represented using no more than $t$ terminals is closed under minors, and has infinitely many forbidden minors.