Saturation for the butterfly poset

DOI10.1112/MTK.12044MaRDI QIDQ5113005zbMATH OpenOpenAlexFDO

Authors Maria-Romina Ivan

Publication date 9 June 2020

Published in Mathematika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2003.01621

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Abstract: Given a finite poset $mathcalP$, we call a family $mathcalF$ of subsets of $[n]$ $mathcalP$-saturated if $mathcalF$ does not contain an induced copy of $mathcalP$, but adding any other set to $mathcalF$ creates an induced copy of $mathcalP$. The induced saturated number of $mathcalP$, denoted by $ext{sat}^{\ast }(n,mathcalP)$, is the size of the smallest $mathcalP$-saturated family with ground set $[n]$. In this paper we are mainly interested in the four-point poset called the butterfly. Ferrara, Kay, Kramer, Martin, Reiniger, Smith and Sullivan showed that the saturation number for the butterfly lies between $lo{g}_{2}n$ and $n^2$. We give a linear lower bound of $n+1$. We also prove some other results about the butterfly and the poset $mathcalN$.

Recommendations

• Supersaturation and stability for forbidden subposet problems.
• The saturation number of induced subposets of the Boolean lattice
• Improved bounds for induced poset saturation
• Induced and non-induced poset saturation problems
• Minimum saturated families of sets

Cites work

• On saturated k-Sperner systems
• Progress on poset-free families of subsets
• The saturation number of induced subposets of the Boolean lattice

Cited in

(14)

• A polynomial upper bound for poset saturation
• Saturation of k-chains in the Boolean lattice
• A general bound for the induced poset saturation problem (extended abstract)
• Induced saturation for complete bipartite posets
• Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron (extended abstract)
• The saturation number of induced subposets of the Boolean lattice
• Induced and non-induced poset saturation problems
• Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
• Induced saturation of the poset 2C₂
• Poset saturation of unions of chains
• Improved bounds for induced poset saturation
• The induced saturation problem for posets
• Supersaturation and stability for forbidden subposet problems.
• Projective and external saturation problem for posets

This page was built for publication: Saturation for the butterfly poset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113005)