Families of finite sets in which no intersection of sets is covered by the union of s others
From MaRDI portal
Publication:696905
DOI10.1006/JCTA.2002.3257zbMATH Open1020.94027OpenAlexW2009085022MaRDI QIDQ696905FDOQ696905
Authors: Arkadii G. D'yachkov, Pavel A. Vilenkin, David C. Torney, Anthony J. Macula 
Publication date: 12 September 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3257
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
Partitions of sets (05A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial codes (94B25) Bounds on codes (94B65)
Cites Work
- Title not available (Why is that?)
- Families of finite sets in which no set is covered by the union of two others
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New constructions of superimposed codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- On the upper bound of the size of the \(r\)-cover-free families
- Title not available (Why is that?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Some new bounds for cover-free families
- On \(r\)-cover-free families
- Interval packing and covering in the Boolean lattice
Cited In (38)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Some new results on superimposed codes
- 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
- Title not available (Why is that?)
- Almost disjunctive list-decoding codes
- Pooling spaces associated with finite geometry
- Improved upper bounds for the rate of separating and completely separating codes
- Extremal families containing no two sets and their union
- Non-adaptive complex group testing with multiple positive sets
- Non-adaptive Learning of a Hidden Hypergraph
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Asymptotic bounds for the rate of colored superimposed codes
- Bounds on the rate of separating codes
- Almost cover-free 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
- Improved constructions for non-adaptive threshold group testing
- Strict group testing and the set basis problem
- 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)
