The saturation number of induced subposets of the Boolean lattice

DOI10.1016/j.disc.2017.06.010zbMath1423.06006arXiv1701.03010OpenAlexW2576813251MaRDI QIDQ2012537

Eric C. Sullivan, Heather C. Smith, Bill Kay, Ryan R. Martin, Michael Ferrara, Lucas Kramer, Benjamin Reiniger

Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

posetssaturationinduced saturation

Mathematics Subject Classification ID

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

Related Items (9)

Almost all permutation matrices have bounded saturation functions ⋮ Improved bounds for induced poset saturation ⋮ Saturation of Ordered Graphs ⋮ SATURATION FOR THE BUTTERFLY POSET ⋮ The induced saturation problem for posets ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ Saturation Problems about Forbidden 0-1 Submatrices ⋮ Induced and non-induced poset saturation problems ⋮ Saturation for small antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Saturating Sperner families
• On saturated \(k\)-Sperner systems
• Induced saturation number
• A survey of minimum saturated graphs
• Bipartite dimensions and bipartite degrees of graphs
• A decomposition theorem for partially ordered sets
• Progress on poset-free families of subsets
• A Problem in Graph Theory
• Berge trigraphs

This page was built for publication: The saturation number of induced subposets of the Boolean lattice