Families of finite sets in which no intersection of sets is covered by the union of s others
From MaRDI portal
(Redirected from Publication:696905)
Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
Recommendations
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- An intersection/union theorem for several families of finite sets
- scientific article; zbMATH DE number 3918366
- Extremal families containing no two sets and their union
- Intersecting families of sets, no \(l\) containing two common elements
- Families of finite sets satisfying intersection restrictions
- Intersecting families of finite sets and fixed-point-free 2-elements
- Families with no s pairwise disjoint sets
- scientific article; zbMATH DE number 3875317
Cites work
- scientific article; zbMATH DE number 3831842 (Why is no real title available?)
- scientific article; zbMATH DE number 4135867 (Why is no real title available?)
- scientific article; zbMATH DE number 4064918 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2154117 (Why is no real title available?)
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- scientific article; zbMATH DE number 1420996 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- Interval packing and covering in the Boolean lattice
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- On r-cover-free families
- On the upper bound of the size of the \(r\)-cover-free families
- Some new bounds for cover-free families
Cited in
(37)- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Nonadaptive algorithms for threshold group testing
- A note on the uniqueness of \((w, r)\) cover-free codes
- A group testing method for finding patterns in data
- Some new results on superimposed codes
- Almost disjunctive list-decoding codes
- scientific article; zbMATH DE number 4135867 (Why is no real title available?)
- Pooling spaces associated with finite geometry
- Extremal families containing no two sets and their union
- Improved upper bounds for the rate of separating and completely separating codes
- Non-adaptive complex group testing with multiple positive sets
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Bounds on the rate of separating codes
- Almost cover-free codes
- Asymptotic bounds for the rate of colored superimposed codes
- Superimposed codes and threshold group testing
- Transport schemes for topology-transparent scheduling
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Exact learning from an honest teacher that answers membership queries
- Hypothesis group testing for disjoint pairs
- New combinatorial structures with applications to efficient group testing with inhibitors
- Bounds on the rate of disjunctive codes
- Separating codes and a new combinatorial search model
- On the complexity of neighbourhood learning in radio networks
- A class of error-correcting pooling designs over complexes
- Threshold and Majority Group Testing
- On optimal superimposed codes
- Non-adaptive complex group testing with multiple positive sets
- Some new bounds for cover-free families through biclique covers
- Uniqueness of some optimal superimposed codes
- Almost cover-free codes and designs
- Cover-free codes and separating system codes
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Strict group testing and the set basis problem
- Non-adaptive learning of a hidden hypergraph
- Smart elements in combinatorial group testing problems with more defectives
- Non-adaptive learning of a hidden hypergraph
This page was built for publication: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696905)
