Union-free hypergraphs and probability theory
From MaRDI portal
Publication:798335
DOI10.1016/S0195-6698(84)80025-6zbMath0546.05049OpenAlexW2146586570MaRDI QIDQ798335
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80025-6
Related Items
2-Cancellative Hypergraphs and Codes, Cancellative pairs of families of sets, On the extremal combinatorics of the Hamming space, Strongly separable matrices for nonadaptive combinatorial group testing, Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices, Smart elements in combinatorial group testing problems with more defectives, The number of maximal independent sets in connected graphs, Applications of coding theory to communication combinatorial problems, Size-maximal symmetric difference-free families of subsets of \([n\)], New Turán Exponents for Two Extremal Hypergraph Problems, New bounds on Simonyi's conjecture, Smart elements in combinatorial group testing problems, A new upper bound for cancellative pairs, Partial dependencies in relational databases and their realization, A better bound for locally thin set families, Asymptotic solution of a Turán-type problem, On Cancellative Set Families, Coding for write-unidirectional memories and conflict resolution, Extremal problems whose solutions are the blowups of the small Witt- designs
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
