An exact result for 3-graphs (Q793054)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact result for 3-graphs |
scientific article; zbMATH DE number 3855159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact result for 3-graphs |
scientific article; zbMATH DE number 3855159 |
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
0 references
0.9319197
0 references
0.89952147
0 references
0.89657277
0 references
0 references
0 references
