✦ LIBER ✦

Embedded antichains in tournaments

✍ Scribed by Stephen J. Greenfield; Brenda J. Latka

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 543 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00079-4

No coin nor oath required. For personal study only.

✦ Synopsis

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 present some questions for further investigation.

📜 SIMILAR VOLUMES

Embedding tournaments in simple tourname

Embedding tournaments in simple tournaments

✍ J.W. Moon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A tournament is simple if the corresp(!nding reEationa1 system is simple in the alge brnlc ~nse. it ir sh~un that cony F~~utnmlent T,, with IT nodes can be embedded in in simple tourrramant r \*+ 1 apart from two exceptional types of tournaments which can be embeddecl rn a %impie Fournczmtn t TR+ 1.

Minimal Antichains in Well-founded Quasi

Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments

✍ Gregory L. Cherlin; Brenda J. Latka 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 190 KB

We investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a well-founded quasi-order. We prove the following finiteness theorem: If Q is a well-founded quasi-order and k a fixed natural number, then there is a finite set 4 k of minimal antichains of Q with the property t

Flattening Antichains

✍ Ákos Kisvölcsey 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

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

Bypaths in tournaments

✍ Yubao Guo; Lutz Volkmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 559 KB

If every arc of a 3-connected tournament T is contained in a cycle of length 3, then every arc of T has a bypath of length k for each k > 3, unless T is isomorphic to two tournaments, each of which has exactly 8 vertices. This extends the corresponding result for regular tournaments, due to Alspach,