Publications of (and about) Paul Erdös
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 \gammap,l such that if n > n0(p,l) then every graph with n vertices and [\gammap,ln2-1/p] edges contains a subgraph H with the following property: the vertices of H may be labbeled x1,...,xl and y1,...,yl so that every edge (xi,yi), where not both i and j exceed p, is in H.
Classif.: * 05C35 Extremal problems (graph theory)
Index Words: topology
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag