##
**Zentralblatt MATH**

**Publications of (and about) Paul Erdös**

**Zbl.No: ** 137.18101

**Autor: ** Erdös, Pál

**Title: ** On an extremal problem in graph theory (In English)

**Source: ** Colloq. Math. 13, 251-254 (1965).

**Review: ** Let l and p be integers such that l > p. It is shown that there exists a constant \gamma_{p,l} such that if n > n_{0}(p,l) then every graph with n vertices and [\gamma_{p,l}n^{2-1/p}] edges contains a subgraph H with the following property: the vertices of H may be labbeled x_{1},...,x_{l} and y_{1},...,y_{l} so that every edge (x_{i},y_{i}), where not both i and j exceed p, is in H.

**Reviewer: ** J.W.Moon

**Classif.: ** * 05C35 Extremal problems (graph theory)

**Index Words: ** topology

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag