๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Clutters and circuits III

โœ Scribed by Lorenzo Traldi


Book ID
105754173
Publisher
Springer
Year
2003
Tongue
English
Weight
134 KB
Volume
49
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Clutters and Circuits
โœ Lorenzo Traldi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

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

Clutters and Circuits, II
โœ Lorenzo Traldi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

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.

Clutters and matroids
โœ Raul Cordovil; Komei Fukuda; Maria Leonor Moreira ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 738 KB

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

Monotone clutters
โœ Guoli Ding ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 700 KB

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

On interval clutters
โœ Guoli Ding ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 157 KB
Clutters with ฯ„2=2ฯ„
โœ Guoli Ding ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 757 KB

## Motivated by Lehman's characterization of the minor-minimal clutters without the MFMC property, we propose a conjecture about the minor-minimal clutters with tlr< kq where k>2 is a fixed integer. We prove, without using Lehman's theorem, this conjecture for the case k=2. We introduce diadic clu