The broken-circuit complex: its structure and factorizations

DOI10.1016/S0195-6698(81)80001-7zbMath0466.05027OpenAlexW2047671760WikidataQ114121538 ScholiaQ114121538MaRDI QIDQ1155063

Tom Brylawski, James G. Oxley

Publication date: 1981

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80001-7

zbMATH Keywords

characteristic polynomialchromatic polynomialmodular flatbrocken-circuits

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Sign-Coherent Identities for Characteristic Polynomials of Matroids ⋮ Modular decomposition of the Orlik-Terao algebra ⋮ Several identities for the characteristic polynomial of a combinatorial geometry ⋮ Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid ⋮ On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals ⋮ Broken circuit complexes and hyperplane arrangements ⋮ Fiber-type arrangements and factorization properties ⋮ Broken circuit complexes: Factorizations and generalizations ⋮ Broken circuit complexes of series-parallel networks ⋮ Flow polynomials of a signed graph ⋮ Chromatic polynomials and order ideals of monomials ⋮ A Möbius identity arising from modularity in a matroid bilinear form

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Several identities for the characteristic polynomial of a combinatorial geometry
• Some matroid inequalities
• Modular elements of geometric lattices
• Modular Constructions for Combinatorial Geometries
• The Broken-Circuit Complex

This page was built for publication: The broken-circuit complex: its structure and factorizations