Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On some combinatorial properties of algebraic matroids

From MaRDI portal
Publication:581407
Jump to:navigation, search

DOI10.1007/BF02579199zbMath0627.05016OpenAlexW2022523090WikidataQ94696320 ScholiaQ94696320MaRDI QIDQ581407

László Lovász, 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

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, Algebraic Matroids in Action, Matroid matching in pseudomodular lattices, p-independence implies pseudomodularity



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Matroid matching and some applications
  • Complexity of Matroid Property Algorithms
  • Non‐Algebraic Matroids exist
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:581407&oldid=12475009"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki