Union-free hypergraphs and probability theory (Q798335): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Peter Frankl / rank | |||
Property / reviewed by | |||
Property / reviewed by: Daniel J. Kleitman / rank | |||
Property / author | |||
Property / author: Peter Frankl / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Daniel J. Kleitman / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sidon sets in groups and induced subgraphs of Cayley graphs / rank | |||
Normal rank | |||
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: Q5771387 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new extremal property of Steiner triple-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Union-free families of sets and equations over fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs without quadrilaterals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4052170 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersections of k-element sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156696 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5781249 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:47, 14 June 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