Forbidden subposet problems in the grid

From MaRDI portal
Publication:2065899



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 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.












This page was built for publication: Forbidden subposet problems in the grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065899)