Jump to content

Forbidden subgraph problem

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Altenmann (talk | contribs) at 04:20, 24 February 2009 (←Created page with 'In extremal graph theory, the '''forbidden subgraph problem''' is the following extremal problem (combinatorics): given a graph ''G'', find the maximal nu…'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In extremal graph theory, the forbidden subgraph problem is the following extremal problem: given a graph G, find the maximal number of edges in an n-vertex graph which does not have a subgraph isomorphic to G. In this context, G is called a forbidden subgraph. [1]

See also

References

  1. ^ p. 53, 54
Retrieved from "https://en.wikipedia.org/w/index.php?title=Forbidden_subgraph_problem&oldid=272890370"