{
  "aliases": [
    "turan-type-problem"
  ],
  "backlinks": null,
  "body": "\n## Problem\n\nIn extremal graph theory, the **forbidden subgraph problem** is the following problem: given a graph $G$, find the maximal number of edges $\\operatorname{ex}(n,G)$ an $n$-vertex graph can have such that it does not have a subgraph [[isomorphic|00CT0PTH74]] to $G$. In this context, $G$ is called a **forbidden subgraph**.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "turan-type-problem"
    ],
    "inventory": [
      "S006MFBYZW"
    ],
    "kind": "problem",
    "name": "Forbidden subgraph problem",
    "same_as": {
      "wikidata": "Q5467390",
      "wikipedia": "Forbidden subgraph problem"
    },
    "sources": [
      {
        "locator": "Forbidden subgraph problem",
        "mention": "wikipedia://en/21682838",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:21682838@r1343710334"
      }
    ],
    "tag": "A4WH2MF2RN"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/A4WH2MF2RN/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/A4WH2MF2RN.md",
  "msc": null,
  "name": "Forbidden subgraph problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/A4W/A4WH2MF2RN.md",
  "status": null,
  "tag": "A4WH2MF2RN",
  "uri": "m2://A4WH2MF2RN",
  "url": "https://math2.tamnd.com/wiki/forbidden-subgraph-problem/",
  "writing": {
    "tag": "A4WH2MF2RN",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      },
      {
        "what": "section History",
        "note": "with the year of the first source",
        "have": 0,
        "want": 1
      }
    ]
  }
}