A single change covering design \(\text{SC}(v,k,b)\) on a \(v\)-set \(V\) is an ordered sequence of \(b\) \(k\)-subsets (blocks) of \(V\) which cover every pair of elements of \(V\) at least once, and such that consecutive blocks intersect in \(k-1\) elements. Then there is one ``change between consecutive blocks, and the total number of changes over the entire sequence is one less than \(b\). The smallest possible number of changes in any \(\text{SC}(v,k,b)\), for fixed \(v\) and \(k\), is denoted by \(c(v,k)\). Here both lower and upper bounds for \(c(v,k)\) are determined. A tabulation of known results for small \(v\) is also given.
- Single-change circular covering designs
- scientific article; zbMATH DE number 800291
- scientific article; zbMATH DE number 759638
- scientific article; zbMATH DE number 786155
- Some New Bounds on Single-Change Covering Designs
- Linear and circular single‐change covering designs revisited
- scientific article; zbMATH DE number 4132175
- scientific article; zbMATH DE number 1792588
- scientific article; zbMATH DE number 3880734
- Single-change circular covering designs
- Tight single-change covering designs with \(v=12, k=4\)
- Some New Bounds on Single-Change Covering Designs
- scientific article; zbMATH DE number 759638 (Why is no real title available?)
- scientific article; zbMATH DE number 786155 (Why is no real title available?)
- scientific article; zbMATH DE number 800291 (Why is no real title available?)
- Finding tight single-change covering designs with v=20, k=5
- Linear and circular single‐change covering designs revisited
- Hamilton cycles in restricted block-intersection graphs
- Recursive and cyclic constructions for double-change covering designs
This page was built for publication: Single change covering designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209218)
