We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set {p}. For p = 2, each of the matroids in our antichain is an excluded m...
James G. Oxley, Charles Semple, Dirk L. Vertigan, ...