New construction of minimal (v,3,2)-coverings
A (v,3,2)-covering is a family of 3-subsets of a v-set, called blocks, such that any two elements of v-set appear in at least one of the blocks. In this paper, we propose new construction of (v,3,2)-coverings with the minimum number of blocks. This construction represents a generalization o...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2016-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2016/0354-02431500017N.pdf |