A Decomposition for Combinatorial Geometries

DOI10.2307/1996381zbMATH Open0224.05007OpenAlexW4251319926WikidataQ56209783 ScholiaQ56209783MaRDI QIDQ5629641FDOQ5629641

Authors:

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/1996381

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• The Tutte polynomial
• Lectures on matroids
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• A higher invariant for matroids
• A Combinatorial Model for Series-Parallel Networks
• Strong maps of geometries
• Modular elements of geometric lattices
• On the Abstract Properties of Linear Dependence
• The Möbius function of a lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries
• Möbius inversion in lattices
• The Tutte-Grothendieck ring
• Lattice Theory of Generalized Partitions

Cited In (98)

• Semimodular Functions and Combinatorial Geometries
• Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs
• Stabilizer theorems for even cycle matroids
• An Inequality for the Möbius Function of a Geometric Lattice
• The computational complexity of knot and matroid polynomials
• A constructive approach to the critical problem for matroids
• The Tutte polynomial of a ported matroid
• Tutte Polynomials and Bicycle Dimension of Ternary Matroids
• Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
• Strong splitter theorem
• The binary matroids whose only odd circuits are triangles
• Dowling group geometries and the critical problem
• Irreducibility of the Tutte polynomial of a connected matroid
• On the colored Tutte polynomial of a graph of bounded treewidth
• The Tutte polynomial of a morphism of matroids. IV: Computational complexity
• Elementary strong maps and transversal geometries
• A bibliography on chromatic polynomials
• The Broken-Circuit Complex
• Capturing matroid elements in unavoidable 3-connected minors
• A Brylawski decomposition for finite ordered sets
• Reconstructing under group actions.
• Finding a small 3-connected minor maintaining a fixed minor and a fixed element
• A note on Nagami's polynomial invariants for graphs
• Chromatic invariants of signed graphs
• On Tutte polynomials of matroids representable over \(GF(q)\)
• Bicycle dimension and special points of the Tutte polynomial
• Cycle cover ratio of regular matroids
• Flows and generalized coloring theorems in graphs
• Latroids and their representation by codes over modules
• The Tutte polynomial of some matroids
• T-uniqueness of some families of \(k\)-chordal matroids
• Modular Constructions for Combinatorial Geometries
• Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory
• Arrangements defined by unitary reflection groups
• On a covering problem of Mullin and Stanton for binary matroids
• A class of rank-invariants for perfect matroid designs
• Ideal clutters
• An Affine Representation for Transversal Geometries
• Connected matroids with the smallest Whitney numbers
• Patroids
• On Crapo's Beta Invariant for Matroids
• On a matroid identity
• On minors avoiding elements in matroids
• Generalized activities and the Tutte polynomial
• The Higgs factorization of a geometric strong map
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Homotopy properties of greedoids
• The \(\mathcal{G}\)-invariant and catenary data of a matroid
• Combinatorial reciprocity theorems
• A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan
• Weak Maps of Combinatorial Geometries
• Binomial Enumeration on Dissects
• On packing minors into connected matroids
• Geometries on partially ordered sets
• A note on the critical problem for matroids
• Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs
• Intersection Theory for Embeddings of Matroids into Uniform Geometries
• Strong Tutte Functions of Matroids and Graphs
• Generalized chromatic polynomials
• On D-complementation
• On regular matroids without certain minors
• Nowhere zero flow and circuit covering in regular matroids
• The Tutte-Grothendieck ring
• Extensions and duality of finite geometric closure operators
• Combinatorial applications of an inequality from statistical mechanics
• Acyclic reorientations of weakly oriented matroids
• Majors of geometric strong maps
• Triangles in 3-connected matroids
• The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
• Matroids, delta-matroids and embedded graphs
• On the computational complexity of the Jones and Tutte polynomials
• The Redei function of a relation
• \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
• On the chromatic number of regular matroids
• New perspectives on polynomial invariants
• The zero forcing polynomial of a graph
• Irreducibility of the Tutte polynomial of an embedded graph
• Characterizations of matroids with an element lying in a restricted number of circuits
• A note on the connectivity of 2-polymatroid minors
• Cyclic flats and corners of the linking polynomial
• Unique representability and matroid reconstruction
• Linear relations for a generalized Tutte polynomial
• Inductive tools for connected delta-matroids and multimatroids
• On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture
• Weighted Tutte-Grothendieck polynomials of graphs
• Universal Tutte characters via combinatorial coalgebras
• Universal Tutte polynomial
• A characterization of jointless Dowling geometries
• Syzygies on Tutte polynomials of freedom matroids
• Valuative invariants for large classes of matroids
• On coefficients of the Tutte polynomial
• On the polymatroid Tutte polynomial
• The binary matroids with no odd circuits of size exceeding five
• Characterizing matroids whose bases form graphic delta-matroids
• Circuit and cocircuit partitions of binary matroids
• Properties of rank preserving weak maps
• The Tutte polynomial characterizes simple outerplanar graphs
• A rank two vector bundle associated to a three arrangement, and its Chern polynomial

This page was built for publication: A Decomposition for Combinatorial Geometries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629641)