On unavoidable hypergraphs

F. R K Chung, P. Erdős

Research output: Article

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)251-263
Number of pages13
JournalJournal of Graph Theory
Volume11
Issue number2
DOIs
Publication statusPublished - 1987

Fingerprint

Hypergraph
Subset

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

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

In: Journal of Graph Theory, Vol. 11, No. 2, 1987, p. 251-263.

Research output: Article

Chung, F. R K ; Erdős, P. / On unavoidable hypergraphs. In: Journal of Graph Theory. 1987 ; Vol. 11, No. 2. pp. 251-263.
@article{5b2788b3c422401ea8c80b5c14d146d8,
title = "On unavoidable hypergraphs",
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.",
author = "Chung, {F. R K} and P. Erdős",
year = "1987",
doi = "10.1002/jgt.3190110215",
language = "English",
volume = "11",
pages = "251--263",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

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

VL - 11

SP - 251

EP - 263

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -