{
  "aliases": [
    "x-bounded",
    "bounded"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **$\\chi$-bounded** (using the Greek letter chi) family $\\mathcal{F}$ of graphs is one for which there is some function $f$ such that, for every integer $t$ the graphs in $\\mathcal{F}$ with $t=\\omega(G)$ (clique number) can be [[colored|0NCPXH194Y]] with at most $f(t)$ colors. The function $f(t)$ is called a **$\\chi$-binding function** for $\\mathcal{F}$. These concepts and their notations were formulated by András Gyárfás. The use of the Greek letter chi in the term $\\chi$-bounded is based on the fact that the chromatic number of a graph $G$ is commonly denoted $\\chi(G)$. An overview of the area can be found in a survey of Alex Scott and Paul Seymour.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "x-bounded",
      "bounded"
    ],
    "inventory": [
      "7ZDTNDEFD2"
    ],
    "kind": "concept",
    "name": "Chi-bounded",
    "same_as": {
      "wikidata": "Q48999677",
      "wikipedia": "Chi-bounded"
    },
    "sources": [
      {
        "locator": "Chi-bounded",
        "mention": "wikipedia://en/56030164",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:56030164@r1365511033"
      }
    ],
    "tag": "H44Q2E3BZR"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/H44Q2E3BZR/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/H44Q2E3BZR.md",
  "msc": null,
  "name": "Chi-bounded",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/H44/H44Q2E3BZR.md",
  "status": null,
  "tag": "H44Q2E3BZR",
  "uri": "m2://H44Q2E3BZR",
  "url": "https://math2.tamnd.com/wiki/chi-bounded/",
  "writing": {
    "tag": "H44Q2E3BZR",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}