{
  "id": "2207.05840",
  "version": "v1",
  "published": "2022-07-12T21:07:43.000Z",
  "updated": "2022-07-12T21:07:43.000Z",
  "title": "Erd\\H os--Hajnal problem for $H$-free hypergraphs",
  "authors": [
    "Danila Cherkashin",
    "Alexei Gordeev",
    "Georgii Strukov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper deals with the minimum number $m_H(r)$ of edges in an $H$-free graph with the chromatic number more than $r$. We show how bounds on Ramsey and Tur\\'an numbers imply bounds on $m_H(r)$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-07-12T21:07:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "free hypergraphs",
      "os-hajnal problem",
      "turan numbers imply bounds",
      "minimum number",
      "free graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}