scientific article; zbMATH DE number 3600054
From MaRDI portal
Publication:4166767
zbMath0386.05020MaRDI QIDQ4166767
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Designs and configurations (05B99)
Related Items (21)
Some combinatorial properties of discriminants in metric vector spaces ⋮ König's theorem and bimatroids ⋮ Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form ⋮ Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations ⋮ Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— ⋮ Combinatorial dynamical system theory: General framework and controllability criteria ⋮ A note on polylinking flow networks ⋮ Poset matching---a distributive analog of independent matching ⋮ A Matroid Abstraction of the Bott–Duffin Constrained Inverse ⋮ A flow model based on polylinking system ⋮ Induction of M-convex functions by linking systems ⋮ Eigensets and power products of a bimatroid ⋮ On structures of bisubmodular polyhedra ⋮ Structural theorems for submodular functions, polymatroids and polymatroid intersections ⋮ The Tutte polynomial of a ported matroid ⋮ Some recent results in combinatorial approaches to dynamical systems ⋮ Boolean sublattices connected with minimization problems on matroids ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Integral decomposition in polyhedra ⋮ Optimal matchings in posets ⋮ A Combinatorial Proof of the All Minors Matrix Tree Theorem
This page was built for publication:
