## Greedoids |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Table of Contents | |

Graphs Partially Ordered Sets and Lattices | |

Operations on Matroids | |

8 other sections not shown

### Common terms and phrases

2-connected algorithmic characterization assume augment balanced interval greedoid basic word basis bipartite branching greedoids chain complex Chapter characterization classes of greedoids closure feasible closure operator combinatorial Consider constraints contains contradiction Conversely convex geometry convex hull convex sets Corollary critical circuit decomposition define deletion denote directed branching dual edges elimination sequence equivalent exchange property exists an element feasible subset feasible word Gauss greedoids Gaussian elimination graph greedo greedoid E,& greedy algorithm ground set Hence hereditary language homotopy implies independence system induction intersection interval property lattice Lemma Let E,& maximal element minimal monotone nodes objective function optimal ordered geometry ordered set partially ordered partially ordered set path polymatroid greedoid poset antimatroid poset greedoid Proof rank feasible sets rank function root satisfies Section semimodular semimodular lattices set system shelling simplicial structures submodular supermatroids Suppose Theorem 1.3 topological transversal Tutte polynomial vector