The broken-circuit complex

The broken-circuit complex introduced by H. Wilf (Which polynomials are chromatic?, Proc. Colloq. Combinational Theory (Rome, 1973)) of a matroid G is shown to be a cone over a related complex, the reduced broken-circuit complex (C'(G). The topological structure of (C'(G) is studied, its Euler characteristic is computed, and joins and skeletons are shown to exist in the class of all such complexes. These computations and constructions are compared with analogous results in the theory of the independent set complex of a matroid. Reduced broken-circuit complexes are partially characterized by conditions concerning which subcomplexes are pure (i.e., have equicardinal maximal simplices). In particular, every matroid complex is a reduced broken-circuit complex. Three proofs are given that the simplex numbers of the cone of (e'(G) are the coefficients which appear in the characteristic polynomial x(G) of G. This relates the work of W. Tutte on externally inactive bases to that of H. Whitney on sets which do not contain broken circuits. One of these proofs gives a combinatorial correspondence between these sets. Properties of the characteristic polynomial are then given topological proofs.