On some combinatorial properties of algebraic matroids

DOI10.1007/BF02579199zbMath0627.05016OpenAlexW2022523090WikidataQ94696320 ScholiaQ94696320MaRDI QIDQ581407

Andreas W. M. Dress

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579199

zbMATH Keywords

minimax theoremmatroid matchingalgebraic matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (15)

On pseudomodular matroids and adjoints ⋮ Singular spaces of matrices and their application in combinatorics ⋮ Oriented cobicircular matroids are \textit{GSP} ⋮ Algebraic matroids are almost entropic ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ Continuous Matroids Revisited ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ On algebraic matroids ⋮ Matroid matching with Dilworth truncation ⋮ Gammoids, pseudomodularity and flatness degree ⋮ The parity problem of polymatroids without double circuits ⋮ Enumerating combinatorial resultant trees ⋮ Algebraic Matroids in Action ⋮ Matroid matching in pseudomodular lattices ⋮ p-independence implies pseudomodularity

Cites Work

• Matroid matching and some applications
• Complexity of Matroid Property Algorithms
• Non‐Algebraic Matroids exist
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some combinatorial properties of algebraic matroids