The broken-circuit complex

Brylawski, Tom

doi:10.1090/S0002-9947-1977-0468931-6

The broken-circuit complex
HTML articles powered by AMS MathViewer

by Tom Brylawski PDF

Trans. Amer. Math. Soc. 234 (1977), 417-433 Request permission

Abstract:

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 $\mathcal {C}’(G)$. The topological structure of $\mathcal {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 $\mathcal {C}’(G)$ are the coefficients which appear in the characteristic polynomial $\chi (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.

References

Norman Biggs, Algebraic graph theory, Cambridge Tracts in Mathematics, No. 67, Cambridge University Press, London, 1974. MR 0347649
Thomas H. Brylawski, A combinatorial model for series-parallel networks, Trans. Amer. Math. Soc. 154 (1971), 1–22. MR 288039, DOI 10.1090/S0002-9947-1971-0288039-7
Thomas H. Brylawski, A decomposition for combinatorial geometries, Trans. Amer. Math. Soc. 171 (1972), 235–282. MR 309764, DOI 10.1090/S0002-9947-1972-0309764-6
Tom Brylawski and Douglas G. Kelly, Matroids and combinatorial geometries, Studies in combinatorics, MAA Studies in Math., vol. 17, Math. Assoc. America, Washington, D.C., 1978, pp. 179–217. MR 0505694
Henry H. Crapo, The Tutte polynomial, Aequationes Math. 3 (1969), 211–229. MR 262095, DOI 10.1007/BF01817442
Henry H. Crapo and Gian-Carlo Rota, On the foundations of combinatorial theory: Combinatorial geometries, Preliminary edition, The M.I.T. Press, Cambridge, Mass.-London, 1970. MR 0290980
Thomas A. Dowling and Richard M. Wilson, Whitney number inequalities for geometric lattices, Proc. Amer. Math. Soc. 47 (1975), 504–512. MR 354422, DOI 10.1090/S0002-9939-1975-0354422-3
Gian-Carlo Rota, On the foundations of combinatorial theory. I. Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2 (1964), 340–368 (1964). MR 174487, DOI 10.1007/BF00531932
Edwin H. Spanier, Algebraic topology, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR 0210112
Richard P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973), 171–178. MR 317988, DOI 10.1016/0012-365X(73)90108-8
W. T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80–91. MR 61366, DOI 10.4153/cjm-1954-010-9
Hassler Whitney, A logical expansion in mathematics, Bull. Amer. Math. Soc. 38 (1932), no. 8, 572–579. MR 1562461, DOI 10.1090/S0002-9904-1932-05460-X
Herbert S. Wilf, Which polynomials are chromatic?, Colloquio Internazionale sulle Teorie Combinatorie (Roma, 1973) Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976, pp. 247–256 (English, with Italian summary). MR 0453579
Tom Brylawski, Modular constructions for combinatorial geometries, Trans. Amer. Math. Soc. 203 (1975), 1–44. MR 357163, DOI 10.1090/S0002-9947-1975-0357163-6