---
tag: A4WH2MF2RN
kind: problem
name: Forbidden subgraph problem
aliases: [turan-type-problem]
sources:
  - wikipedia: en:21682838@r1343710334
    locator: Forbidden subgraph problem
    note: adopted
    mention: wikipedia://en/21682838
    sections: [Problem]
same_as:
  wikidata: Q5467390
  wikipedia: Forbidden subgraph problem
inventory: [S006MFBYZW]
---

## Problem

In 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**.