Zentralblatt MATH

Publications of (and about) Paul Erdös

Zbl.No:  527.05042
Autor:  Chung, F.R.K.; Erdös, Paul
Title:  On unavoidable graphs. (In English)
Source:  Combinatorica 3, 167-176 (1983).
Review:  A graph G is called an (n,e)-unavoidable graph if every graph on n vertices and e edges contains G as a subgraph. Let f(n,e) denote the largest integer m with the property that there exists an (n,e)-unavoidable graph on m edges. In this paper the authors obtain bounds on f(n,e) which are in many cases asymptotically best possible.
Reviewer:  L.Lesniak
Classif.:  * 05C35 Extremal problems (graph theory)
Keywords:  subgraphs; Turan-like property; unavoidable graph

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag

Books Problems Set Theory Combinatorics Extremal Probl/Ramsey Th.
Graph Theory Add.Number Theory Mult.Number Theory Analysis Geometry
Probabability Personalia About Paul Erdös Publication Year Home Page