✳flâneur — a map of the web's best reading

[2604.06521] The Exact Saturation Number for the Diamond

arxiv.org · 112 words · saved by 1 readers

Abstract:What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain has this property, and thus the answer is at most $n+1$. Despite the simplicity of the diamond structure, the lower bound stagnated at $\sqrt n$ for quite some time, until recently the authors obtained a linear lower bound. In this paper, we fully solve this question showing that such a family must have size at least $n+1$.

The Exact Saturation Number for the Diamond What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain has this property, and thus the answer is at most $n+1$. Despite the simplicity of the diamond structure, the lower bound stagnated at $\sqrt n$ for quite some time, until recently the authors obtained a linear lower bound. In this paper, we fully solve this question showing that such a family must have size at leas

Explore this link on the map →

saved by

related reading