Explore relationships

forbidden subgraph problem

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G{\displaystyle G}, find the maximal number of edges ex⁡(n,G){\displaystyle \operatorname {ex} (n,G)} an n{\displaystyle n}-vertex graph can have such that it does not have a subgraphisomorphic to G{\displaystyle G}.

Use + to expand a branch. Click a topic name to open its summary.