Balázs Patkós: Forbidden subposet problems in the grid

Abstract: For posets $P$ and $Q$, extremal and saturation problems about weak and strong $P$-free subposets of $Q$ have been studied mostly in the case $Q$ is  the Boolean poset $Q_n$, the poset of all subsets of an $n$-element set ordered by inclusion. In this talk, we study some instances of the problem with $Q$ being the grid, and its connections to the Boolean case and to the forbidden submatrix problem.

The zoom link:
https://zoom.us/j/91399666052?pwd=VCtmb0U0RVI5ckE4eXNHQkV0c1l0QT09
If needed, the passcode is 222823.