##
**Zentralblatt MATH**

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

**Zbl.No: ** 725.05062

**Autor: ** Chung, F.R.K.; Erdös, Paul

**Title: ** On unavoidable hypergraphs. (In English)

**Source: ** J. Graph Theory 11, No.2, 251-263 (1987).

**Review: ** An r-uniform hypergraph H (or an r-graph, for short) is a collection E = E(H) of r-element subsets (called edges) of a set V = V(H) (called vertices). We say an r-graph H is (n,e)-unavoidable if every r-graph with n vertices and e edges must contain H. In this paper we investigate the largest possible number of edges in an (n,e)-unavoidable 3-graph for fixed n ande. We also study the structure of such unavoidable 3-graphs.

**Classif.: ** * 05C65 Hypergraphs

**Keywords: ** unavoidable hypergraphs; edges

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag