Skip to main content

Part of the book series: Algorithms and Combinatorics ((AC,volume 6))

  • 481 Accesses

Abstract

One of our first examples at the introduction of matroids was the following. Let T be an arbitrary field, V[T] be a vector space over T and S be a set of vectors from this vector space. This set leads to a matroid M = (S, F) as follows: XS is independent (denoted by XF) if and only if the vectors, belonging to X are linearly independent over T.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Recski, A. (1989). Algebraic and geometric representation of matroids. In: Matroid Theory and its Applications in Electric Network Theory and in Statics. Algorithms and Combinatorics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22143-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-22143-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-22145-7

  • Online ISBN: 978-3-662-22143-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics