### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology

### Cite this

*Journal of Graph Theory*,

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

**On unavoidable hypergraphs.** / Chung, F. R K; Erdős, P.

Research output: Contribution to journal › Article

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

}

TY - JOUR

T1 - On unavoidable hypergraphs

AU - Chung, F. R K

AU - Erdős, P.

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986505794&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986505794&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190110215

DO - 10.1002/jgt.3190110215

M3 - Article

AN - SCOPUS:84986505794

VL - 11

SP - 251

EP - 263

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -