Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
From MaRDI portal
Publication:1163564
DOI10.1016/0012-365X(81)90199-0zbMath0484.05027MaRDI QIDQ1163564
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Semimodular lattices, geometric lattices (06C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Techniques in matroid reconstruction ⋮ Intersection theory for graphs ⋮ Characterizing combinatorial geometries by numerical invariants ⋮ T-uniqueness of some families of \(k\)-chordal matroids ⋮ The \(\mathcal{G}\)-invariant and catenary data of a matroid ⋮ Orbit-counting polynomials for graphs and codes ⋮ Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants ⋮ Arrangements and cohomology
Cites Work
- A congruence theorem for trees
- Intersection theory for graphs
- On the nonreconstructibility of combinatorial geometries
- The Tutte polynomial
- A Combinatorial Model for Series-Parallel Networks
- A Decomposition for Combinatorial Geometries
- A Contribution to the Theory of Chromatic Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hyperplane reconstruction of the Tutte polynomial of a geometric lattice