Note on the Splitting Property in Strongly Dense Posets of Size $\aleph_0$
Mirna Džamonja
TL;DR
The paper addresses whether every countably infinite strongly dense poset has the splitting property, answering in the negative with a countable strongly dense counterexample. It constructs the poset by iteratively replacing each node of a binary tree with a copy of the tree and taking the union, yielding a specific maximal antichain that fails to split. This refutes the conjecture and clarifies the limits of the finite case results, situating the finding in the broader discussion of Sperner systems and order theory. The work demonstrates that additional hypotheses are needed for a splitting guarantee in the countable setting.
Abstract
We show that it is not true that every countable infinite strongly dense poset has the splitting property, so answering a question of R. Ahlswede, P.L. Erdös and N. Graham.
