Skip to main content
SpringerLink
Log in

On some combinatorial properties of algebraic matroids

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

It was proved implicitly by Ingleton and Main and explicitly by Lindström that if three lines in the algebraic matroid consisting of all elements of an algebraically closed field are not coplanar, but any two of them are, then they pass through one point. This theorem is extended to a more general result about the intersection of subspaces in full algebraic matroids. This result is used to show that the minimax theorem for matroid matching, proved for linear matroids by Lovász, remains valid for algebraic matroids.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. W. Ingleton andR. A. Main, Non-algebraic matroids exist.Bull. Lonbon Math. Soc. 7 (1975) 144–146.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. M. Jensen andB. Korte, Complexity of matroid property algorithms.SIAM J. on Computing,11 (1982) 184–190.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Lindström, A non-algebraic matroid of rank three.Math. Scandinavica (submitted).

  4. B. Lindström, On harmonic conjugates in algebraic matroids.Europ. J. Comb. (submitted).

  5. L. Lovász, Selecting independent lines from a family of lines in a projective space.Acta Sci. Math. 42 (1980), 121–131.

    MATH  Google Scholar 

  6. L. Lovász, Matroid matching and some applications.J. Comb. Theory 28 (1980), 208–236.

    Article  MATH  Google Scholar 

  7. L. Lovász. The matroid matching problem. in:Algebraic Methods in Graph Theory, Coll. Math Soc. J. Bolyai 25, North Holland, Amsterdam 1981.

    Google Scholar 

  8. Po Tong, E. L. Lawler andV. V. Vazirani, Solving the Weighted Parity problem for gammoids by reduction to graphic matching.in: Progress in Combinatorial Optimization (W. Pulleyblank, ed.), Academic Press, 1984, 363–374.

  9. van der Waerden,Moderne Algebra. 2nd edition, Berlin, 1937, 6th edition, Springer, Berlin/Heidelberg/New York, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät f. Math., Universität Bielefeld, D-4800, Bielefeld 1, G. F. R.

    A. Dress

  2. Dept. Comp. Sci. Mathematical Institute, Eötvös University, 1088, Múzeum krt 6–8, Hungary

    L. Lovász

Authors
  1. A. Dress
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Lovász
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dress, A., Lovász, L. On some combinatorial properties of algebraic matroids. Combinatorica 7, 39–48 (1987). https://doi.org/10.1007/BF02579199

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579199

AMS subject classification (1980)

Search

Navigation