Premium
On unavoidable hypergraphs
Author(s) -
Chung F. R. K.,
Erdös P.
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110215
Subject(s) - combinatorics , hypergraph , mathematics , graph , discrete mathematics
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.