Poset saturation of unions of chains

DOI10.1007/S11083-026-09731-6MaRDI QIDQ6844126zbMATH OpenFDO

Authors Shengjin Ji, Balázs Patkós, Erfei Yue

Publication date 16 March 2026

Published in Order (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11083-026-09731-6

zbMATH Keywords

chainsextremal set theoryforbidden subposet problemsaturation

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites work

• A polynomial upper bound for poset saturation
• An extremal problem for two families of sets
• Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• Improved bounds for induced poset saturation
• Induced and non-induced poset saturation problems
• Induced saturation for complete bipartite posets
• On generalized graphs
• On saturated k-Sperner systems
• Progress on poset-free families of subsets
• Saturating Sperner families
• Saturation for small antichains
• Saturation for the butterfly poset
• Saturation of k-chains in the Boolean lattice
• The induced saturation problem for posets
• The saturation number of induced subposets of the Boolean lattice

This page was built for publication: Poset saturation of unions of chains

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