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
We analyze the axiomatic strength of the following theorem due to Rival and Sands in the style of re...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
A structural condition is given for finite maximal antichains in the homomorphism order of relationa...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
AbstractTwo duality theorems are proved about the direct product of two partial orders. First, the s...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
0: Introduction and background. This paper is the third in a series devoted to the study of infinite...
In set theory without the axiom of choice (AC), we observe new relations of the following statements...
AbstractWe prove that König's duality theorem for infinite graphs (every graph G has a matching F su...
For given positive integers $k$ and $n$, a family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is $k$...
We analyze the axiomatic strength of the following theorem due to Rival and Sands in the style of re...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
A structural condition is given for finite maximal antichains in the homomorphism order of relationa...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
AbstractTwo duality theorems are proved about the direct product of two partial orders. First, the s...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
0: Introduction and background. This paper is the third in a series devoted to the study of infinite...
In set theory without the axiom of choice (AC), we observe new relations of the following statements...
AbstractWe prove that König's duality theorem for infinite graphs (every graph G has a matching F su...
For given positive integers $k$ and $n$, a family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is $k$...
We analyze the axiomatic strength of the following theorem due to Rival and Sands in the style of re...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
A structural condition is given for finite maximal antichains in the homomorphism order of relationa...