A Decomposition for Combinatorial Geometries

From MaRDI portal
Revision as of 04:07, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (96)

The Broken-Circuit ComplexThe binary matroids whose only odd circuits are trianglesOn the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of GraphsUniversal Tutte characters via combinatorial coalgebrasUniversal Tutte polynomialDowling group geometries and the critical problemFinding a small 3-connected minor maintaining a fixed minor and a fixed elementHomotopy properties of greedoidsLatroids and their representation by codes over modulesReconstructing under group actions.A bibliography on chromatic polynomialsSemimodular Functions and Combinatorial GeometriesA note on Nagami's polynomial invariants for graphsOn Tutte polynomials of matroids representable over \(GF(q)\)The binary matroids with no odd circuits of size exceeding fiveFlows and generalized coloring theorems in graphsSyzygies on Tutte polynomials of freedom matroidsElementary strong maps and transversal geometriesOn a covering problem of Mullin and Stanton for binary matroidsWeighted Tutte-Grothendieck polynomials of graphsExtensions and duality of finite geometric closure operatorsStrong splitter theoremOn the polymatroid Tutte polynomialA class of rank-invariants for perfect matroid designsThe Redei function of a relationUnique representability and matroid reconstructionCapturing matroid elements in unavoidable 3-connected minorsThe Tutte polynomial of some matroidsA constructive approach to the critical problem for matroidsHyperplane reconstruction of the Tutte polynomial of a geometric latticeAn Affine Representation for Transversal GeometriesArrangements defined by unitary reflection groupsAn Inequality for the Möbius Function of a Geometric LatticeChromatic invariants of signed graphsGeneralized activities and the Tutte polynomialT-uniqueness of some families of \(k\)-chordal matroidsThe Tutte polynomial of a morphism of matroids. III: Vectorial matroidsA rank two vector bundle associated to a three arrangement, and its Chern polynomialTriangles in 3-connected matroidsThe zero forcing polynomial of a graphOn minors avoiding elements in matroidsCyclic flats and corners of the linking polynomialThe \(\mathcal{G}\)-invariant and catenary data of a matroidCombinatorial reciprocity theoremsThe Tutte polynomial of a morphism of matroids. IV: Computational complexityCombinatorial applications of an inequality from statistical mechanicsIdeal cluttersUnnamed ItemOn the colored Tutte polynomial of a graph of bounded treewidthMajors of geometric strong mapsProperties of rank preserving weak mapsA recipe theorem for the topological Tutte polynomial of Bollobás and RiordanCircuit and cocircuit partitions of binary matroidsRelative Tutte Polynomials for Coloured Graphs and Virtual Knot TheoryGeometries on partially ordered setsConnected matroids with the smallest Whitney numbersStrong Tutte Functions of Matroids and GraphsOn the chromatic number of regular matroidsThe Higgs factorization of a geometric strong mapLarge Wk- or K3,t-Minors in 3-Connected GraphsModular Constructions for Combinatorial GeometriesOn the computational complexity of the Jones and Tutte polynomialsBinomial Enumeration on DissectsThe Tutte polynomial of a ported matroidCharacterizing matroids whose bases form graphic delta-matroidsBicycle dimension and special points of the Tutte polynomialMatroids, delta-matroids and embedded graphsA Brylawski decomposition for finite ordered setsOn the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness ConjectureThe Tutte-Grothendieck ringOn a matroid identityPatroidsA characterization of jointless Dowling geometriesCharacterizations of matroids with an element lying in a restricted number of circuitsOn coefficients of the Tutte polynomialOn packing minors into connected matroidsIntersection Theory for Embeddings of Matroids into Uniform GeometriesA note on the connectivity of 2-polymatroid minorsWeak Maps of Combinatorial GeometriesA note on the critical problem for matroidsIrreducibility of the Tutte polynomial of a connected matroidGeneralized chromatic polynomialsLinear relations for a generalized Tutte polynomialOn D-complementationOn regular matroids without certain minorsOn Crapo's Beta Invariant for MatroidsTutte Polynomials and Bicycle Dimension of Ternary MatroidsThe computational complexity of knot and matroid polynomials\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition methodIrreducibility of the Tutte polynomial of an embedded graphCycle cover ratio of regular matroidsAcyclic reorientations of weakly oriented matroidsNowhere zero flow and circuit covering in regular matroidsStabilizer theorems for even cycle matroidsLattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphsInductive tools for connected delta-matroids and multimatroids




Cites Work




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