Monotone clutters
โ Scribed by Guoli Ding
- Book ID
- 103056284
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 700 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k-monotone, completely monotone or threshold, respectively. A characterization of k-monotone clutters in terms ofexcluded minors is presented here. This result is used to derive a characterization of 2-monotone matroids and of 3-monotone matroids (which turn out to be all the threshold matroids).
๐ SIMILAR VOLUMES
A map on clutters (collections of incomparable sets of a given set) is a function defined from the class of all clutters to itself, that sends a clutter on a ground set E to a clutter on the same set. Here we study two maps on clutters, the blocker map and the complementary map. Our main results in
We introduce a way to associate a family of circuits to an arbitrary clutter, suggested by a theorem of Lehman. Several characterizations of matroid ports using their circuits are presented. แฎ 1997 Academic Press 0 0 0 ลฝ . component of M that contains e , then P M, e is completely unaffected 0 0 by
We continue to study ways of defining circuits associated with clutters, and we give several new characterizations of matroid ports using their circuits. We also discuss the use of these circuits to analyze redundancies among elements appearing in nonmatroidal reliability problems.