We investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a well-founded quasi-order. We prove the following finiteness ...

We investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a well-founded quasi-order. We prove the following finiteness ...

We investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a well-founded quasi-order. We prove the following finiteness ...

Cherlin, G. L. and Latka, B. J.: Minimal Antichains in well-founded quasi-orders with an application to tournaments, J. Combin. Theory B 80 (2000), 258–276 ...

Tournament embedding is an order relation on the class of finite tournaments. An antichain is a set of finite tournaments that are pairwise incomparable in this ...

A quasi order being a well quasi order is connected to arbitrary ... Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments.

Theorem 5 is best possible since to obtain a well-quasi-ordered set, we can only allow finitely many members in each of the 16 infinite disjoint antichains ...

Abstract. The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infi-.

Dec 22, 2023 · (1) A is above some minimal element of Id. (α). (C)). If A is minimal, then Id(A) is well-founded and. H(A) ≤ ω.α, where H(A) ∶= h(A,Id(C)) ...

Minimal antichains in well-founded quasi-orders with an application to tournaments · Publikation auswählen · Gregory L. Cherlin, Brenda J. Latka.