In a linear algebra class the students are introduced to the ideas of linear independence and convexity. In combinatorics, matroids arise as an abstraction of independence and antimatroids arise from convexity. Greedoids are a generalization of both ideas.
This talk will be an introduction to the subject of greedoids. Axiomatic ideas and examples will be discussed. Furthermore, some interesting subclasses of greedoids will be introduced.