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

At least 3 years old · documented by

Let PP be a poset on [p][p], and let P˙\dot P be the poset on [p+1][p+1] obtained by adjoining a new element that dominates every element of PP. Let sat∗(n,P)\text{sat}^*(n,P) denote the minimum size of an induced PP-saturated family of subsets of [n][n]. Keszegh–Lemons–Martin–Pálvölgyi–Patkós's extension conjecture.

sat∗(n,P)=O(1)if and only ifsat∗(n,P˙)=O(1).\text{sat}^*(n,P)=O(1)\quad\text{if and only if}\quad\text{sat}^*(n,\dot P)=O(1).

This conjecture concerns which posets have bounded induced saturation number and is presented as an open research direction in the paper. No resolution is given.

References

Primary source

Andrea Freschi, Simón Piga, Maryam Sharifzadeh and Andrew Treglown, “The induced saturation problem for posets”, arXiv:2207.03974 (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.