Union-free hypergraphs and probability theory

DOI10.1016/S0195-6698(84)80025-6zbMath0546.05049MaRDI QIDQ798335

Peter Frankl, Zoltan Fueredi

Publication date: 1984

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

maximum number of distinct subsets

Mathematics Subject Classification ID

05C65: Hypergraphs

05A05: Permutations, words, matrices

60C05: Combinatorial probability

Related Items

On Cancellative Set Families, A better bound for locally thin set families, Extremal problems whose solutions are the blowups of the small Witt- designs, Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices, Applications of coding theory to communication combinatorial problems, Partial dependencies in relational databases and their realization, Coding for write-unidirectional memories and conflict resolution, Cancellative pairs of families of sets, On the extremal combinatorics of the Hamming space, Asymptotic solution of a Turán-type problem, The number of maximal independent sets in connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new extremal property of Steiner triple-systems
• Sidon sets in groups and induced subgraphs of Cayley graphs
• Union-free families of sets and equations over fields
• Intersections of k-element sets
• Three-graphs without two triples whose symmetric difference is contained in a third
• Graphs without quadrilaterals