Andrey Kupavskii: Concentration inequalities for matchings
Kupavskii AndreyExtremal Set Systems Seminar
on 4/15/21
What is the maximum integer k, such that given any collection of k disjoint symmetric chains in the poset of subsets of a finite sets, we can enlarge the collection to a symmetric chain decomposition of the poset? I don't know the answer, but in this talk, I will discuss a special case, and a number of related results and questions.