Keszegh–Lemons–Martin–Pálvölgyi–Patkós dichotomy conjecture for induced poset saturation

Let PP be a finite poset, and let sat([2]n,P)\mathrm{sat}^{\star}([2]^n,P) denote its induced saturation function in the Boolean lattice. Keszegh–Lemons–Martin–Pálvölgyi–Patkós' dichotomy conjecture. There exists a constant CPC_P such that either

sat([2]n,P)CP\mathrm{sat}^{\star}([2]^n,P)\leq C_P

for all nn, or

sat([2]n,P)n+1\mathrm{sat}^{\star}([2]^n,P)\geq n+1

for all sufficiently large nn. This conjecture sharpens the known bounded-versus-unbounded dichotomy for induced poset saturation; its status is unclear from the supplied text.

Sources & referencesView supporting material

Primary source

R. Altar Ciceksiz, Victor Falgas-Ravry, Sabrina Lato and Maryam Sharifzadeh, “Induced poset saturation in the hypergrid”, arXiv:2604.12641 (2026).

Additional references

3 papers in this index state this conjecture (2022–2026). The statement above is taken from the most recent of them; the others are arXiv:2402.08651, arXiv:2207.03974.

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.