Name
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 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. (c) 2021 The Author(s). Published by Elsevier B.V. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.disc.2021.112720 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Forbidden subposet, Grid, Boolean lattice, Extremal set system, Extremal combinatorics | Journal | 345 |
Issue | ISSN | Citations |
3 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 0 | 1.35 |
| Dániel T. Nagy | 2 | 0 | 2.37 |
| Balázs Patkós | 3 | 0 | 0.34 |
| Máté Vizer | 4 | 0 | 0.34 |