scientific article; zbMATH DE number 3365295
From MaRDI portal
Publication:5638342
zbMath0231.05027MaRDI QIDQ5638342
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (51)
Divisors on graphs, binomial and monomial ideals, and cellular resolutions ⋮ Recognizing a class of bicircular matroids ⋮ Matroid union -- graphic? binary? neither? ⋮ A Property Equivalent to Exchange Property in Matroids ⋮ Representations of matroids and free resolutions for multigraded modules ⋮ A circuit set characterization of antimatroids ⋮ Polyhedra of regular p-nary group problems ⋮ A short proof of Tutte's characterization of totally unimodular matrices ⋮ The circuit basis in binary matroids ⋮ The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids ⋮ Unavoidable Induced Subgraphs of Large 2-Connected Graphs ⋮ Complement total unimodularity ⋮ Partition coefficients of acyclic graphs ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ Matroids with many common bases. ⋮ Discrete extremal problems ⋮ Alpha-balanced graphs and matrices and GF(3)-representability of matroids ⋮ Lattices, graphs, and Conway mutation ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ Decomposition of group flows in regular matroids ⋮ Die Jaboci-Abbildung über dem Raum der Mumfordkurven ⋮ Matroid intersection algorithms ⋮ Dirac's theorem on simplicial matroids ⋮ The graphicity of the union of graphic matroids ⋮ A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices ⋮ A decomposition theory for matroids. VII: Analysis of minimal violation matrices ⋮ On matroid connectivity ⋮ On matroids on edge sets of graphs with connected subgraphs as circuits. II ⋮ Subgraphs as circuits and bases of matroids ⋮ Separation of vertices by a circuit ⋮ On a definition of connected sets of a matroid ⋮ Oriented matroids ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Graphic matroids and the multicommodity transportation problem ⋮ Hypergraph Horn functions ⋮ Covering finite fields with cosets of subspaces ⋮ Bridges and Hamiltonian circuits in planar graphs ⋮ Matroids, generalized networks, and electric network synthesis ⋮ A Tiled Order of Finite Global Dimension with No Neat Primitive Idempotent ⋮ On matroidal families ⋮ A polynomial invariant and duality for triangulations ⋮ Matroids and antimatroids - a survey ⋮ On Four Problems in Graph Theory ⋮ On subgraphs as matroid cells ⋮ On the efficiency of representability tests for matroids ⋮ Patroids ⋮ On functions of strength t ⋮ Nowhere-zero integral flows on a bidirected graph ⋮ A note on the critical problem for matroids ⋮ Uncovering generalized-network structure in matrices ⋮ Closure systems and their structure
This page was built for publication:
