加载中…
Given a poset , a family of elements in the Boolean lattice is said to be -saturated if does not contain an induced copy , but every proper superset of contains one. The minimum size of a -saturated family in the -dimensional Boolean lattice is denoted by .\par In this paper, we consider the poset (the four element poset with one minimal element and three incomparable maximal elements) and show that . This represents the first linear lower bound for , improving upon the previously best-known bound of . Our result establishes that .

生成讲解博客的中文版本

生成AI智能校验的中文版本