Families of finite sets in which no set is covered by the union of \(r\) others
From MaRDI portal
Publication:1072559
DOI10.1007/BF02772959zbMath0587.05021OpenAlexW2164604747WikidataQ105487976 ScholiaQ105487976MaRDI QIDQ1072559
Paul Erdős, Peter Frankl, Zoltan Fueredi
Publication date: 1985
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02772959
Related Items (only showing first 100 items - show all)
On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Bounds and algorithms for generalized superimposed codes ⋮ A New Design of Online/Offline Signatures Based on Lattice ⋮ Lattice-based programmable hash functions and applications ⋮ Improved bounds for the dimension of divisibility ⋮ Unnamed Item ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Broadcast authentication for group communication ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Hardness of approximate two-level logic minimization and PAC learning with membership queries ⋮ On the upper bound of the size of the \(r\)-cover-free families ⋮ 2-Cancellative Hypergraphs and Codes ⋮ On the structure of a class of sets useful in nonadaptive group testing ⋮ A fast network-decomposition algorithm and its applications to constant-time distributed computation ⋮ Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison ⋮ On the extremal combinatorics of the Hamming space ⋮ Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Tracing a single user ⋮ A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation ⋮ Generalised cumulative arrays in secret sharing ⋮ Secret sharing schemes with partial broadcast channels ⋮ A simple construction of \(d\)-disjunct matrices with certain constant weights ⋮ On key storage in secure networks ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Finding defective coins ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ New error-correcting pooling designs with vector spaces over finite field ⋮ Broadcasting in an Unreliable SINR Model. ⋮ Black-box Trace\&Revoke codes ⋮ Faster deterministic wakeup in multiple access channels ⋮ Modification tolerant signature schemes: location and correction ⋮ Uniform hypergraphs containing no grids ⋮ Information dissemination in unknown radio networks with large labels ⋮ Constructing error-correcting pooling designs with symplectic space ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Separating codes and a new combinatorial search model ⋮ A Black-Box Construction of Strongly Unforgeable Signature Schemes in the Bounded Leakage Model ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Locating and detecting arrays for interaction faults ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ On non-binary traceability set systems ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Forbidden configurations and repeated induction ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ New Turán Exponents for Two Extremal Hypergraph Problems ⋮ Some intriguing upper bounds for separating hash families ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Some new bounds for cover-free families ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ General theory of information transfer: Updated ⋮ Coding for a multiple access OR channel: A survey ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Transport schemes for topology-transparent scheduling ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Combinatorial algorithms for distributed graph coloring ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Some new bounds for cover-free families through biclique covers ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ Predicate signatures from pair encodings via dual system proof technique ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ A novel use of \(t\)-packings to construct \(d\)-disjunct matrices ⋮ Pooling designs associated with unitary space and ratio efficiency comparison ⋮ A classification of the structures of some Sperner families and superimposed codes ⋮ Union-intersection-bounded families and their applications ⋮ Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition ⋮ Deterministic M2M multicast in radio networks ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ More on pooling spaces ⋮ On the construction of \((w,r)\) cover-free codes ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Separable collusion-secure multimedia codes ⋮ Upper bounds for parent-identifying set systems ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Matchings and covers in hypergraphs ⋮ Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Combinatorial Algorithms for Distributed Graph Coloring ⋮ Group testing with geometry of classical groups over finite fields ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Non-adaptive group testing in the presence of errors ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ On Efficient Gossiping in Radio Networks ⋮ RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
Cites Work
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of two others
- On Sperner families satisfying an additional condition
- Combinatorial properties of systems of sets
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A General Intersection Theorem For Finite Sets
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- On generalized graphs
This page was built for publication: Families of finite sets in which no set is covered by the union of \(r\) others
