✦ LIBER ✦

Clutters and Circuits

✍ Scribed by Lorenzo Traldi

Book ID: 102558075
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 199 KB
Volume: 18
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1996.0512

No coin nor oath required. For personal study only.

✦ Synopsis

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 the structure of M outside M . On the other hand, Lehman proved that 0 Ž . P M, e completely determines M ; here is the best-known statement of 0 0 this result. LEHMAN'S THEOREM. Let M be a matroid on a set E and let M be the 0 component of M containing a particular element e . Then the circuits of M 0 0 220

📜 SIMILAR VOLUMES

Clutters and circuits III

✍ Lorenzo Traldi 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 134 KB

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