Weakly union-free twofold triple systems (Q1387611)
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: Weakly union-free twofold triple systems |
scientific article; zbMATH DE number 1160053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weakly union-free twofold triple systems |
scientific article; zbMATH DE number 1160053 |
Statements
Weakly union-free twofold triple systems (English)
0 references
14 January 1999
0 references
The authors settle the problem of Frankl and Füredi (a special case of a problem of Erdős) which is to determine the maximum number of edges in a 3-uniform hypergraph in which no two pairs of distinct edges have the same union. The extremal case corresponds to the question of existence of weakly union-free twofold triple systems; this question is given a complete answer up to four possible exceptions. An application to group testing is also given.
0 references
twofold triple system
0 references
group divisible design
0 references
hypergraph
0 references
