An exact result for 3-graphs (Q793054): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Three-graphs without two triples whose symmetric difference is contained in a third / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3313888 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Ramsey - Turan type theorems for hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4052170 / rank | |||
Normal rank | |||
Revision as of 11:44, 14 June 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
