### Abstract

Let ℓ be a set-system of r-element subsets on an n-element set, r≧3. It is proved that if |ℓ|>3.5 {Mathematical expression} then ℓ contains four distinct members A, B, C, D such that A∪B=C∪D and A∩B=C∩D=0.

Original language | English |
---|---|

Pages (from-to) | 161-168 |

Number of pages | 8 |

Journal | Combinatorica |

Volume | 4 |

Issue number | 2-3 |

DOIs | |

Publication status | Published - Jun 1 1984 |

### Keywords

- AMS subject classification (1980): 05A05, 05C35, 05C65

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Hypergraphs in which all disjoint pairs have distinct unions'. Together they form a unique fingerprint.

## Cite this

Füredi, Z. (1984). Hypergraphs in which all disjoint pairs have distinct unions.

*Combinatorica*,*4*(2-3), 161-168. https://doi.org/10.1007/BF02579216