AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part intersects the chain. Related to both Aharoni's extension of the König duality theorem and Dilworth's theorem, this is an important conjecture in the theory of infinite orders. It is verified for ordered sets of the form C×P, where C is a chain and P is finite, and for ordered sets with no infinite antichains and no infinite intervals
summary:In set theory without the axiom of choice (AC), we observe new relations of the following st...
A class of finite tournaments determined by a set of "forbidden subtournaments" is wellqua...
1. Every anti-chain in P has cardinality 1 =) every anti-chain in F has cardinality 1 2. There exist...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
0: Introduction and background. This paper is the third in a series devoted to the study of infinite...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractDoes every partial order of singular cofinality λ have an antichain of size cf(λ)? This is t...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractThere are several standard constructions by which an arbitrary ordered set is extended to on...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
summary:In set theory without the axiom of choice (AC), we observe new relations of the following st...
A class of finite tournaments determined by a set of "forbidden subtournaments" is wellqua...
1. Every anti-chain in P has cardinality 1 =) every anti-chain in F has cardinality 1 2. There exist...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
0: Introduction and background. This paper is the third in a series devoted to the study of infinite...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractDoes every partial order of singular cofinality λ have an antichain of size cf(λ)? This is t...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractThere are several standard constructions by which an arbitrary ordered set is extended to on...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
summary:In set theory without the axiom of choice (AC), we observe new relations of the following st...
A class of finite tournaments determined by a set of "forbidden subtournaments" is wellqua...
1. Every anti-chain in P has cardinality 1 =) every anti-chain in F has cardinality 1 2. There exist...