Hypergraphs in which all disjoint pairs have distinct unions

Research output: Contribution to journalArticle

12 Citations (Scopus)


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 languageEnglish
Pages (from-to)161-168
Number of pages8
Issue number2-3
Publication statusPublished - Jun 1 1984


  • 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