Golden ratios in a pairs covering problem (Q1166533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3769644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Golden ratios in a pairs covering problem |
scientific article; zbMATH DE number 3769644 |
Statements
Golden ratios in a pairs covering problem (English)
0 references
1982
0 references
pair-covering system
0 references
A set \( B=\left\{B_{1}, B_{2}, \ldots, B_{r}\right\} \) of \(m\)-subsets of an \( n \)-set \( A_{n} \) is said to cover \( A_{n} \) if every is to determine \( N(m, n) \), the smallest \( r \), so that \( B \) covers \( A_{n} \). It is shown that \( N(m, n)=3 \) if \( \frac{2}{3} \leq \frac{m}{n}<1 ; 4 \) if \( \frac{3}{5} \leq \frac{m}{n}<\frac{2}{3} ; 5 \) if \( \frac{5}{9} \leq \frac{m}{n}<\frac{3}{5} ; \) and 6 if \( \frac{1}{2} \leq \frac{m}{n}<\frac{5}{9} \). However, when \( \frac{m}{n}<\frac{1}{2} \) monotonicity of \( N(m, n) \) as a function of \( m / n \) no longer exists. This is shown by the fact that \( N(3,7)=7 \) whilst \( N(4,9)=8 \).
0 references