No label defined (Q4945050)

A poset \(P\) has the splitting property if every maximal antichain \(S\) may be partitioned into disjoint subsets \(S_1\) and \(S_2\) such that the union of the upset of \(S_1\) with the downset of \(S_2\) yields the entire poset. Under suitable assumptions the authors establish splitting properties in great generality for infinite posets, directed graphs and set systems. The poset of square-free integers is shown to be an example of a countable poset which does not have the splitting property. In addition, the splitting ratio \[ \min\left \{\frac{|S_2|}{|S_1|}: S_1, S_2 \;\text{give a splitting}\right\} \] is studied. Finally, new notions of splitting are introduced. For the entire collection see [Zbl 0933.00056].