2021/02/16 by Gerbner, Dániel, Nagy, Dániel T., Patkós, Balázs +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2102.08297
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 Qn, the poset of all subsets of an n-element set ordered by inclusion. In this paper, 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.