On a matroid identity
From MaRDI portal
Publication:1835677
DOI10.1016/0012-365X(83)90006-7zbMath0504.05022MaRDI QIDQ1835677
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Sign-Coherent Identities for Characteristic Polynomials of Matroids ⋮ On the numbers of bases and circuits in simple binary matroids ⋮ Modularity in tangential k-blocks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the numbers of bases and circuits in simple binary matroids
- On a covering problem of Mullin and Stanton for binary matroids
- Several identities for the characteristic polynomial of a combinatorial geometry
- On the chromatic number of regular matroids
- The Tutte polynomial
- COLOURING, PACKING AND THE CRITICAL PROBLEM
- A Decomposition for Combinatorial Geometries
This page was built for publication: On a matroid identity