The broken-circuit complex: its structure and factorizations
From MaRDI portal
Publication:1155063
DOI10.1016/S0195-6698(81)80001-7zbMATH Open0466.05027OpenAlexW2047671760WikidataQ114121538 ScholiaQ114121538MaRDI QIDQ1155063FDOQ1155063
Authors: Tom Brylawski, James 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
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Broken-Circuit Complex
- Modular Constructions for Combinatorial Geometries
- Title not available (Why is that?)
- Modular elements of geometric lattices
- Some matroid inequalities
- Several identities for the characteristic polynomial of a combinatorial geometry
Cited In (12)
- Chromatic polynomials and order ideals of monomials
- Modular decomposition of the Orlik-Terao algebra
- Broken circuit complexes and hyperplane arrangements
- On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
- Fiber-type arrangements and factorization properties
- Broken circuit complexes: Factorizations and generalizations
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Flow polynomials of a signed graph
- Broken circuit complexes of series-parallel networks
- Several identities for the characteristic polynomial of a combinatorial geometry
- Sign-Coherent Identities for Characteristic Polynomials of Matroids
- A Möbius identity arising from modularity in a matroid bilinear form
This page was built for publication: The broken-circuit complex: its structure and factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155063)
