In combinatorics, a branch of mathematics, a matroid /ˈmeɪtrɔɪd/ is a structure that captures and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid, the most significant being in terms of independent sets, bases, circuits, closed sets or flats, closure operators, and rank functions.
Matroid theory borrows extensively from the terminology of linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory.
There are many equivalent (cryptomorphic) ways to define a (finite) matroid.
In terms of independence, a finite matroid is a pair
, where
is a finite set (called the ground set) and
is a family of subsets of
(called the independent sets) with the following properties:
Out to lunch
Speak your piece
Good and drunk
Back on the street
What you see is what you get
No matter what you say
No time for anything
To take the pain away
You sure ain't the chosen few
I know you've turned a trick or two
You pulled the deuce this time
Another perfect day
Golden boy
Take your chance
You're a clockwork toy
You're a dime a dance
The truth is only black and white
No shade of gray
It's easy answers babe
There is the hell to pay
You know it's just the same to you
Ain't nothing you can do
No chance to change it now
Another perfect day
Total war
Blow your stack
Say no more
You know you can't go back
You're acting dumb baby, you don't know
The places you can go
You know you tell the truth
In a different way
No court of law would find for you
No matter what you do
Could be the perfect crime