An exact result for 3-graphs (Q793054)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact result for 3-graphs |
scientific article |
Statements
An exact result for 3-graphs (English)
0 references
1984
0 references
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.
0 references
3-graphs
0 references
Turan's problem
0 references
