### Abstract

A r‐uniform hypergraph H (or a 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 a 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 and e. We also study the structure of such unavoidable 3‐graphs.

Original language | English |
---|---|

Pages (from-to) | 251-263 |

Number of pages | 13 |

Journal | Journal of Graph Theory |

Volume | 11 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1987 |

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'On unavoidable hypergraphs'. Together they form a unique fingerprint.

## Cite this

Chung, F. R. K., & Erdős, P. (1987). On unavoidable hypergraphs.

*Journal of Graph Theory*,*11*(2), 251-263. https://doi.org/10.1002/jgt.3190110215