Forbidden subposet problems in the grid
From MaRDI portal
Publication:2065899
Abstract: For posets and , extremal and saturation problems about weak and strong -free subposets of have been studied mostly in the case is the Boolean poset , the poset of all subsets of an -element set ordered by inclusion. In this paper, we study some instances of the problem with being the grid, and its connections to the Boolean case and to the forbidden submatrix problem.
Recommendations
Cites work
- l-Chain Profile Vectors
- A LYM inequality for induced posets
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Extremal Finite Set Theory
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- Forbidden induced subposets of given height
- scientific article; zbMATH DE number 3845613 (Why is no real title available?)
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- Induced and non-induced poset saturation problems
- Largest family without A B C D
- On a lemma of Littlewood and Offord
- On families of subsets with a forbidden subposet
- Progress on poset-free families of subsets
- Saturation problems about forbidden 0-1 submatrices
- Set families with a forbidden subposet
- The method of double chains for largest families with excluded subposets
Cited in
(5)
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)