an:03855159
Zbl 0538.05050
Frankl, P.; F??redi, Z.
An exact result for 3-graphs
EN
Discrete Math. 50, 323-328 (1984).
00149133
1984
j
05C65 05A05 05C35
3-graphs; Turan's problem
Consider a hypergraph G with n vertices whose edge-set E is a subset of the set of all triplets of vertices of G. The authors give a complete description of all such hypergraphs with the property that every subset of four vertices of G contains either 0 or 2 triplets in G.
J.W.Moon