Transversal greedoids

DOI10.1006/EUJC.1992.0072MaRDI QIDQ674616zbMATH OpenOpenAlexFDO

Authors Peter A. Brooksbank

Publication date 5 March 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a1963fc55dc09614a98cc66ff9b8ea1f76f5a004

zbMATH Keywords

exchange propertygreedy algorithmset systemstransversal greedoids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

A new class of set systems is defined in terms of transversals of sets. Examination of the structure of these systems reveals that they are in fact examples of strong greedoids, namely greedoids which are greedy algorithm compatible, called by the author transversal greedoids. In this paper, such set systems are shown to be characterized by a simple exchange property.

Recommendations

• Gaussian, strong and transversal greedoids
• Greedoids
• scientific article; zbMATH DE number 3954942
• Introduction to Greedoids

Cited in

(5)

• Gaussian, strong and transversal greedoids
• Exchange systems
• A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
• scientific article; zbMATH DE number 4093481 (Why is no real title available?)
• Greedoids

This page was built for publication: Transversal greedoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674616)