On saturated \(k\)-Sperner systems

zbMath1300.05310arXiv1402.5646MaRDI QIDQ405311

Jonathan A. Noel, Natasha Morrison, Alexander D. Scott

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

minimum saturationset systemsSperner systems

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10)

Related Items

Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ Improved bounds for induced poset saturation ⋮ The saturation spectrum for antichains of subsets ⋮ SATURATION FOR THE BUTTERFLY POSET ⋮ The induced saturation problem for posets ⋮ Saturated Subgraphs of the Hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ Induced and non-induced poset saturation problems ⋮ The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) ⋮ Partite Saturation Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Saturating Sperner families
• The saturation function of complete partite graphs
• A survey of minimum saturated graphs
• Saturated \(r\)-uniform hypergraphs
• Asymptotic evaluation of the sat-function for \(r\)-stars
• All minimum C5-saturated graphs
• Saturated graphs with minimal number of edges
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory
• Saturated Subgraphs of the Hypercube
• On a Conjecture of Erdos, Hajnal and Moon
• On a lemma of Littlewood and Offord