Families of finite sets in which no set is covered by the union of two others
From MaRDI portal
Publication:1166519
DOI10.1016/0097-3165(82)90004-8zbMath0489.05003OpenAlexW2019294877WikidataQ105487967 ScholiaQ105487967MaRDI QIDQ1166519
Paul Erdős, Zoltan Fueredi, Peter Frankl
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(82)90004-8
Related Items (43)
On the upper bound of the size of the \(r\)-cover-free families ⋮ 2-Cancellative Hypergraphs and Codes ⋮ Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ Improved algorithms for group testing with inhibitors ⋮ On the extremal combinatorics of the Hamming space ⋮ A simple construction of \(d\)-disjunct matrices with certain constant weights ⋮ On key storage in secure networks ⋮ Constructions and bounds for \((m,t)\)-splitting systems ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Uniform hypergraphs containing no grids ⋮ Avoiding right angles and certain Hamming distances ⋮ Near-sunflowers and focal families ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Unnamed Item ⋮ Applications of coding theory to communication combinatorial problems ⋮ Generalized cover-free families. ⋮ Strict group testing and the set basis problem ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Some new bounds for cover-free families ⋮ Almost cover-free codes and designs ⋮ Some new bounds for cover-free families through biclique covers ⋮ Exhaustive testing of almost all devices with outputs depending on limited number of inputs ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Recursive bounds for perfect hashing ⋮ A classification of the structures of some Sperner families and superimposed codes ⋮ Union-intersection-bounded families and their applications ⋮ Broadcast authentication for group communication ⋮ Delta-systems and qualitative (in)dependence ⋮ Separable collusion-secure multimedia codes ⋮ Matchings and covers in hypergraphs ⋮ Coding for write-unidirectional memories and conflict resolution ⋮ Tropical Complexity, Sidon Sets, and Dynamic Programming ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families ⋮ Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) ⋮ Sets pooling designs ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ Families of finite sets in which no set is covered by the union of \(r\) others ⋮ Explicit construction of exponential sized families of k-independent sets ⋮ Almost disjunctive list-decoding codes
Cites Work
This page was built for publication: Families of finite sets in which no set is covered by the union of two others
