{
  "id": "2102.08297",
  "version": "v1",
  "published": "2021-02-16T17:32:58.000Z",
  "updated": "2021-02-16T17:32:58.000Z",
  "title": "Forbidden subposet problems in the grid",
  "authors": [
    "Dániel Gerbner",
    "Dániel T. Nagy",
    "Balázs Patkós",
    "Máté Vizer"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-02-16T17:32:58.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "forbidden subposet problems",
      "forbidden submatrix problem",
      "free subposets",
      "boolean poset",
      "saturation problems"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}