Union-free hypergraphs and probability theory (Q798335): 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/s0195-6698(84)80025-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2146586570 / rank | |||
Normal rank |
Latest revision as of 12:11, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Union-free hypergraphs and probability theory |
scientific article |
Statements
Union-free hypergraphs and probability theory (English)
0 references
1984
0 references
This paper contains new lower and upper bounds on the number of subsets of an n element set one can have so that the union of no two equals that of two others. A new lower bound is obtained when no two unions of any kind are the same; and a new upper bound when no set has the same union with two others. Related problems when the sets have size restrictions are reviewed and some new results obtained. The lower bounds are obtained by probabilistic reasoning, while one upper bound uses an entropy argument and the other follows by an induction.
0 references
maximum number of distinct subsets
0 references