A polynomial upper bound for poset saturation

DOI10.1016/J.EJC.2024.103970MaRDI QIDQ6945778zbMATH OpenFDO

Authors Paul Bastide, Carla Groenland, Maria-Romina Ivan, Tom Johnston

Publication date 8 August 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/366565

zbMATH Keywords

induced copy of a posetsaturation number

Mathematics Subject Classification ID

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

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron (extended abstract)
• Extremal Finite Set Theory
• Improved bounds for induced poset saturation
• Induced and non-induced poset saturation problems
• On saturated k-Sperner systems
• On the density of families of sets
• Saturating Sperner families
• Saturation for the butterfly poset
• The saturation number of induced subposets of the Boolean lattice

Cited in

(6)

• Induced saturation of the poset 2C₂
• Poset saturation of unions of chains
• Saturation of k-chains in the Boolean lattice
• Induced saturation for complete bipartite posets
• Optimal embeddings of posets in hypercubes
• Linear saturation for \(\mathcal{N}\) via butterflies

This page was built for publication: A polynomial upper bound for poset saturation

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