Improved bounds for induced poset saturation

DOI10.37236/8949zbMath1481.06016arXiv1908.01108OpenAlexW3030386554MaRDI QIDQ2185221

Ryan R. Martin, Heather C. Smith, Shanise Walker

Publication date: 4 June 2020

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

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

Mathematics Subject Classification ID

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

Related Items (3)

The induced saturation problem for posets ⋮ Induced and non-induced poset saturation problems ⋮ Saturation for small antichains

Cites Work

• Saturating Sperner families
• On saturated \(k\)-Sperner systems
• A survey of minimum saturated graphs
• The saturation number of induced subposets of the Boolean lattice
• A decomposition theorem for partially ordered sets
• Progress on poset-free families of subsets
• A Problem in Graph Theory

This page was built for publication: Improved bounds for induced poset saturation