|Title: Recent progress on diamond-free families|
|Speaker: Ryan Martin of Iowa State University|
|Contact: Dwight Duffus, Dwight@mathcs.emory.edu|
|Date: 2015-03-23 at 4:00PM|
In the Boolean lattice, a diamond is a subposet of four distinct subsets $A, B, C, D$ such that $A \subset B, C$ and $D \supset B, C$. One of the most well-studied problems in extremal poset theory is determining the size of the largest diamond-free family in the $n$-dimensional Boolean lattice. We will discuss some recent progress on this problem.
See All Seminars