Pages that link to "Item:Q5519908"
From MaRDI portal
The following pages link to On separating systems of a finite set (Q5519908):
Displaying 42 items.
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- Search problems in vector spaces (Q498971) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Optimality aspects of row-column designs with non-orthogonal structure (Q689406) (← links)
- A generalization of completely separating systems (Q713133) (← links)
- On separating systems whose elements are sets of at most k elements (Q754202) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- Ratewise-optimal non-sequential search strategies under constraints on the tests (Q947084) (← links)
- Nonadaptive group testing with lies: probabilistic existence theorems (Q984649) (← links)
- Revisiting sequential search using question-sets with bounded intersections (Q1001709) (← links)
- On two random search problems (Q1058449) (← links)
- Sequential search using question-sets with bounded intersections (Q1168888) (← links)
- The edge-coloring of complete hypergraphs. I (Q1260045) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- Completely separating systems of \(k\)-sets (Q1382833) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- On face numbers of manifolds with symmetry (Q1771030) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Existence theorems for some group testing strategies (Q1817291) (← links)
- Geometric systems of unbiased representatives (Q2122784) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- On separating systems with bounded set size (Q2309567) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- Partition dimension of projective planes (Q2400970) (← links)
- Identifying defective sets using queries of small size (Q2411609) (← links)
- Inclusionwise minimal completely separating systems (Q2431691) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- Compressions and Probably Intersecting Families (Q2883868) (← links)
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (Q3449986) (← links)
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem (Q3895483) (← links)
- Collections of Subsets with the Sperner Property (Q3944608) (← links)
- Density-Based Group Testing (Q4915256) (← links)
- Minimal completely separating systems of \(k\)-sets (Q5929844) (← links)
- Optimal superimposed codes and designs for Renyi's search model (Q5957831) (← links)
- A combinatorial search problem on matroids (Q5957832) (← links)
- Search with small sets in presence of a liar (Q5957834) (← links)
- On the Rényi-Ulam game with restricted size queries (Q6108923) (← links)
- A product version of the Hilton-Milner theorem (Q6133632) (← links)
- Separating path systems of almost linear size (Q6571612) (← links)
