Uniform boundedness of external saturation for posets

Let PP be a poset, and let !extsat(n,P)\mathop{}\\!\operatorname{extsat}(n,P) denote the minimum size of an external PP-saturated family for the Boolean lattice Bn{\mathcal B}_n, as defined in the paper. External saturation conjecture. For every poset PP, there exists a constant CPC_P independent of nn such that

extsat(n,P)CP.\operatorname{extsat}(n,P)\le C_P.

The authors note that the dichotomy arguments for projective saturation also apply to external saturation, but no poset with unbounded external saturation number is known. This is the precise formal version of the preceding abstract-level conjecture.

Sources & referencesView supporting material

Primary source

Dömötör Pálvölgyi and Balázs Patkós, “Projective and external saturation problem for posets”, arXiv:2306.10387 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.