PC Seminar: Induced saturation problems for POSets

Join on site or via Zoom (Meeting ID: 968 699 3627, Passcode: 536004)

Abstract:I will talk about saturation type problems. These questions can be considered as a dual to Tur\'an type questions. The main focus would be on the induced saturation questions for POSets.

For a fixed poset $P$, a family $\mathcal F$ of subsets  of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of  $\mathcal F \cup \{S\}$.  I will mainly talk about some recent developments, proof techniques and some open questions.

This is a seminar in our seminar series on Probability and Combinatorics (PC).