Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
From MaRDI portal
(Redirected from Publication:6615500)
Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- A new matching property for posets and existence of disjoint chains
- A short proof of the existence of k-saturated partitions of partially ordered sets
- Collections of Subsets with the Sperner Property
- Ein Satz über Untermengen einer endlichen Menge.
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Improved bounds for induced poset saturation
- Induced and non-induced poset saturation problems
- Lexicographic matching in Boolean algebras
- Long symmetric chains in the Boolean lattice
- On disjoint chains of subsets
- On saturated k-Sperner systems
- Saturating Sperner families
- Saturation for small antichains
- Saturation for the butterfly poset
- Sperner theory in a difference of Boolean lattices
- Strong versions of Sperner's theorem
- The induced saturation problem for posets
- The saturation number of induced subposets of the Boolean lattice
- The width of downsets
- Uniform chain decompositions and applications
- Zur allgemeinen Kurventheorie.
Cited in
(8)- Saturation for small antichains
- Induced saturation of the poset 2C₂
- Poset saturation of unions of chains
- Induced saturation for complete bipartite posets
- Gluing posets and the dichotomy of poset saturation numbers
- Optimal embeddings of posets in hypercubes
- Linear saturation for \(\mathcal{N}\) via butterflies
- Saturation for sums of posets and antichains
This page was built for publication: Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615500)