Uncoverings-by-bases for graphic matroids
by
Robert Bailey
Carleton University

An uncovering-by-bases (or UBB) for a matroid M=(E,I) is a set U of bases of M such that any t-subset of E is disjoint from at least one base in U, for some non-negative integer t.

In the case of the cycle matroid of a connected graph G, this is simply a collection of spanning trees for G. I will describe some constructions of UBBs for graphic matroids, and some possible applications in network reliability.

Date received: February 22, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cauz-06.