A Decomposition for Combinatorial Geometries
From MaRDI portal
Publication:5629641
DOI10.2307/1996381zbMath0224.05007OpenAlexW4251319926WikidataQ56209783 ScholiaQ56209783MaRDI QIDQ5629641
No author found.
Publication date: 1972
Full work available at URL: https://doi.org/10.2307/1996381
Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
The Broken-Circuit Complex, The binary matroids whose only odd circuits are triangles, On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs, Universal Tutte characters via combinatorial coalgebras, Universal Tutte polynomial, Dowling group geometries and the critical problem, Finding a small 3-connected minor maintaining a fixed minor and a fixed element, Homotopy properties of greedoids, Latroids and their representation by codes over modules, Reconstructing under group actions., A bibliography on chromatic polynomials, Semimodular Functions and Combinatorial Geometries, A note on Nagami's polynomial invariants for graphs, On Tutte polynomials of matroids representable over \(GF(q)\), The binary matroids with no odd circuits of size exceeding five, Flows and generalized coloring theorems in graphs, Syzygies on Tutte polynomials of freedom matroids, Elementary strong maps and transversal geometries, On a covering problem of Mullin and Stanton for binary matroids, Weighted Tutte-Grothendieck polynomials of graphs, Extensions and duality of finite geometric closure operators, Strong splitter theorem, On the polymatroid Tutte polynomial, A class of rank-invariants for perfect matroid designs, The Redei function of a relation, Unique representability and matroid reconstruction, Capturing matroid elements in unavoidable 3-connected minors, The Tutte polynomial of some matroids, A constructive approach to the critical problem for matroids, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, An Affine Representation for Transversal Geometries, Arrangements defined by unitary reflection groups, An Inequality for the Möbius Function of a Geometric Lattice, Chromatic invariants of signed graphs, Generalized activities and the Tutte polynomial, T-uniqueness of some families of \(k\)-chordal matroids, The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, A rank two vector bundle associated to a three arrangement, and its Chern polynomial, Triangles in 3-connected matroids, The zero forcing polynomial of a graph, On minors avoiding elements in matroids, Cyclic flats and corners of the linking polynomial, The \(\mathcal{G}\)-invariant and catenary data of a matroid, Combinatorial reciprocity theorems, The Tutte polynomial of a morphism of matroids. IV: Computational complexity, Combinatorial applications of an inequality from statistical mechanics, Ideal clutters, Unnamed Item, On the colored Tutte polynomial of a graph of bounded treewidth, Majors of geometric strong maps, Properties of rank preserving weak maps, A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan, Circuit and cocircuit partitions of binary matroids, Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory, Geometries on partially ordered sets, Connected matroids with the smallest Whitney numbers, Strong Tutte Functions of Matroids and Graphs, On the chromatic number of regular matroids, The Higgs factorization of a geometric strong map, Large Wk- or K3,t-Minors in 3-Connected Graphs, Modular Constructions for Combinatorial Geometries, On the computational complexity of the Jones and Tutte polynomials, Binomial Enumeration on Dissects, The Tutte polynomial of a ported matroid, Characterizing matroids whose bases form graphic delta-matroids, Bicycle dimension and special points of the Tutte polynomial, Matroids, delta-matroids and embedded graphs, A Brylawski decomposition for finite ordered sets, On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture, The Tutte-Grothendieck ring, On a matroid identity, Patroids, A characterization of jointless Dowling geometries, Characterizations of matroids with an element lying in a restricted number of circuits, On coefficients of the Tutte polynomial, On packing minors into connected matroids, Intersection Theory for Embeddings of Matroids into Uniform Geometries, A note on the connectivity of 2-polymatroid minors, Weak Maps of Combinatorial Geometries, A note on the critical problem for matroids, Irreducibility of the Tutte polynomial of a connected matroid, Generalized chromatic polynomials, Linear relations for a generalized Tutte polynomial, On D-complementation, On regular matroids without certain minors, On Crapo's Beta Invariant for Matroids, Tutte Polynomials and Bicycle Dimension of Ternary Matroids, The computational complexity of knot and matroid polynomials, \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method, Irreducibility of the Tutte polynomial of an embedded graph, Cycle cover ratio of regular matroids, Acyclic reorientations of weakly oriented matroids, Nowhere zero flow and circuit covering in regular matroids, Stabilizer theorems for even cycle matroids, Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs, Inductive tools for connected delta-matroids and multimatroids
Cites Work
- Unnamed Item
- Unnamed Item
- The Tutte polynomial
- Möbius inversion in lattices
- Modular elements of geometric lattices
- The Tutte-Grothendieck ring
- Lattice Theory of Generalized Partitions
- On the Abstract Properties of Linear Dependence
- The Möbius function of a lattice
- Lectures on matroids
- Strong maps of geometries
- A higher invariant for matroids
- A Combinatorial Model for Series-Parallel Networks
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- A Contribution to the Theory of Chromatic Polynomials