Document Type
Article
Publication Date
8-15-1993
Abstract
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 of excluded 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). © 1993.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
67
Last Page
77
Recommended Citation
Ding, G. (1993). Monotone clutters. Discrete Mathematics, 119 (1-3), 67-77. https://doi.org/10.1016/0012-365X(93)90117-C
COinS