2 papers
math.CO2017
The Saturation Number of Induced Subposets of the Boolean Lattice
Michael Ferrara, Bill Kay, Lucas Kramer +4
Given a poset , a family of elements in the Boolean lattice is said to be -saturated if (1) contains no copy of as a subposet and (2) every proper superset of …
math.CO2015
An improved bound on the diamond-free poset problem
Lucas Kramer, Ryan R. Martin
In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if is a family in the -dimension…