✦ LIBER ✦

Flattening Antichains

✍ Scribed by Ákos Kisvölcsey

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 221 KB
Volume: 26
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-006-0005-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antichain sequences

✍ Kathie Cameron 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 378 KB

Antichain cutsets

✍ Ivan Rival; Nejib Zaguia 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 523 KB

A subset A of an ordered set P is a cutset if each maximal chain of P meetsA ; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a 'forbidden configuration', of those finite ordered sets, which can be expressed as the union of ant

Traces of antichains

✍ P. Frankl 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 227 KB

Diamond and antichains

✍ James Cummings; Ernest Schimmerling 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 115 KB

Orbits of antichains revisited

✍ P.J Cameron; D.G Fon-Der-Flaass 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Embedded antichains in tournaments

✍ Stephen J. Greenfield; Brenda J. Latka 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 543 KB

The maximum antichain cardinality (MACC) of a tournament is the maximum number of incomparable subtournaments of \(T\). We establish some properties of MACC. We describe all tournaments whose MACC is 1 or 2 , show that MACC can grow exponentially with the size of the vertex set of a tournament, and