An exact result for 3-graphs (Q793054): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(84)90058-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029849517 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
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
