On some combinatorial properties of algebraic matroids

DOI10.1007/BF02579199MaRDI QIDQ581407zbMATH OpenOpenAlexWikidataFDO

Authors Andreas W. M. Dress, László Lovász

Publication date 1987

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

algebraic matroidsmatroid matchingminimax theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

The minimax theorem for matroid matching, originally proved for linear matroids only [\textit{L. Lovász}, Acta Sci. Math. 42, 121-131 (1980; Zbl 0449.51008)] is shown to hold for algebraic matroids as well. The main tool of the proof is a generalization of a lemma (implicitly proved by Ingleton and Main, explicitly by Lindström) that if three lines in the algebraic matroid consisting all elements of an algebraically closed field are not coplanar but any two of them are then they pass through one point.

Recommendations

• On algebraic matroids
• scientific article; zbMATH DE number 3867357
• scientific article; zbMATH DE number 3843764
• On properties of almost all matroids
• scientific article; zbMATH DE number 4114646
• scientific article; zbMATH DE number 4156
• scientific article; zbMATH DE number 3880730
• On matroids and Orlik-Solomon algebras
• On a generalization of the matroid
• scientific article; zbMATH DE number 3926940

Cites work

• Complexity of Matroid Property Algorithms
• scientific article; zbMATH DE number 3878951 (Why is no real title available?)
• scientific article; zbMATH DE number 3902670 (Why is no real title available?)
• scientific article; zbMATH DE number 3703542 (Why is no real title available?)
• Matroid matching and some applications
• Non‐Algebraic Matroids exist

Cited in

(26)

• Matroid matching in pseudomodular lattices
• A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids
• On matroids and Orlik-Solomon algebras
• On pseudomodular matroids and adjoints
• Gammoids, pseudomodularity and flatness degree
• Matroid matching with Dilworth truncation
• Continuous matroids revisited
• scientific article; zbMATH DE number 3867357 (Why is no real title available?)
• Some Arithmetic Properties of Matroidal Ideals
• scientific article; zbMATH DE number 4006284 (Why is no real title available?)
• SOME NECESSARY CONDITIONS FOR SUMS OF MATROIDS
• Singular spaces of matrices and their application in combinatorics
• A weighted linear matroid parity algorithm
• Algebraic matroids in action
• On maximal and minimal linear matching property
• Oriented cobicircular matroids are \textit{GSP}
• Algebraic matroids are almost entropic
• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• Enumerating combinatorial resultant trees
• On algebraic matroids
• Optimizing extension techniques for discovering non-algebraic matroids
• A note on extension properties and representations of matroids
• On forbidden configuration of pseudomodular lattices.
• Combinatorial resultants in the algebraic rigidity matroid
• p-independence implies pseudomodularity
• The parity problem of polymatroids without double circuits

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

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