Some characterization theorems for circuit spaces associated with graphs

A circuit space is an independence space (or matroid) in which each basis is contained in a circuit. In this paper we consider various independence spaces associated with a graph and seek to discover for which graphs these spaces are circuit spaces and, in particular, truncated spaces. Some definitive results are obtained and some interesting questions are left open.