Covering and packing for pairs

Yeow Meng Chee, Charles Colbourn, Alan C H Ling, Richard M. Wilson

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

When a v-set can be equipped with a set of k-subsets so that every 2-subset of the v-set appears in exactly (or at most, or at least) one of the chosen k-subsets, the result is a balanced incomplete block design (or packing, or covering, respectively). For each k, balanced incomplete block designs are known to exist for all sufficiently large values of v that meet certain divisibility conditions. When these conditions are not met, one can ask for the packing with the most blocks and/or the covering with the fewest blocks. Elementary necessary conditions furnish an upper bound on the number of blocks in a packing and a lower bound on the number of blocks in a covering. In this paper it is shown that for all sufficiently large values of v, a packing and a covering on v elements exist whose numbers of blocks differ from the basic bounds by no more than an additive constant depending only on k.

Original languageEnglish (US)
Pages (from-to)1440-1449
Number of pages10
JournalJournal of Combinatorial Theory. Series A
Volume120
Issue number7
DOIs
StatePublished - Sep 2013

Fingerprint

Packing
Covering
Balanced Incomplete Block Design
Subset
Divisibility
Lower bound
Upper bound
Necessary Conditions

Keywords

  • Balanced incomplete block design
  • Group divisible design
  • Pair covering
  • Pair packing
  • Pairwise balanced design

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Covering and packing for pairs. / Chee, Yeow Meng; Colbourn, Charles; Ling, Alan C H; Wilson, Richard M.

In: Journal of Combinatorial Theory. Series A, Vol. 120, No. 7, 09.2013, p. 1440-1449.

Research output: Contribution to journalArticle

Chee, Yeow Meng ; Colbourn, Charles ; Ling, Alan C H ; Wilson, Richard M. / Covering and packing for pairs. In: Journal of Combinatorial Theory. Series A. 2013 ; Vol. 120, No. 7. pp. 1440-1449.
@article{a0d48fbc8c8c4bb4815f9c1fb8619c72,
title = "Covering and packing for pairs",
abstract = "When a v-set can be equipped with a set of k-subsets so that every 2-subset of the v-set appears in exactly (or at most, or at least) one of the chosen k-subsets, the result is a balanced incomplete block design (or packing, or covering, respectively). For each k, balanced incomplete block designs are known to exist for all sufficiently large values of v that meet certain divisibility conditions. When these conditions are not met, one can ask for the packing with the most blocks and/or the covering with the fewest blocks. Elementary necessary conditions furnish an upper bound on the number of blocks in a packing and a lower bound on the number of blocks in a covering. In this paper it is shown that for all sufficiently large values of v, a packing and a covering on v elements exist whose numbers of blocks differ from the basic bounds by no more than an additive constant depending only on k.",
keywords = "Balanced incomplete block design, Group divisible design, Pair covering, Pair packing, Pairwise balanced design",
author = "Chee, {Yeow Meng} and Charles Colbourn and Ling, {Alan C H} and Wilson, {Richard M.}",
year = "2013",
month = "9",
doi = "10.1016/j.jcta.2013.04.005",
language = "English (US)",
volume = "120",
pages = "1440--1449",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "7",

}

TY - JOUR

T1 - Covering and packing for pairs

AU - Chee, Yeow Meng

AU - Colbourn, Charles

AU - Ling, Alan C H

AU - Wilson, Richard M.

PY - 2013/9

Y1 - 2013/9

N2 - When a v-set can be equipped with a set of k-subsets so that every 2-subset of the v-set appears in exactly (or at most, or at least) one of the chosen k-subsets, the result is a balanced incomplete block design (or packing, or covering, respectively). For each k, balanced incomplete block designs are known to exist for all sufficiently large values of v that meet certain divisibility conditions. When these conditions are not met, one can ask for the packing with the most blocks and/or the covering with the fewest blocks. Elementary necessary conditions furnish an upper bound on the number of blocks in a packing and a lower bound on the number of blocks in a covering. In this paper it is shown that for all sufficiently large values of v, a packing and a covering on v elements exist whose numbers of blocks differ from the basic bounds by no more than an additive constant depending only on k.

AB - When a v-set can be equipped with a set of k-subsets so that every 2-subset of the v-set appears in exactly (or at most, or at least) one of the chosen k-subsets, the result is a balanced incomplete block design (or packing, or covering, respectively). For each k, balanced incomplete block designs are known to exist for all sufficiently large values of v that meet certain divisibility conditions. When these conditions are not met, one can ask for the packing with the most blocks and/or the covering with the fewest blocks. Elementary necessary conditions furnish an upper bound on the number of blocks in a packing and a lower bound on the number of blocks in a covering. In this paper it is shown that for all sufficiently large values of v, a packing and a covering on v elements exist whose numbers of blocks differ from the basic bounds by no more than an additive constant depending only on k.

KW - Balanced incomplete block design

KW - Group divisible design

KW - Pair covering

KW - Pair packing

KW - Pairwise balanced design

UR - http://www.scopus.com/inward/record.url?scp=84876886213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876886213&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2013.04.005

DO - 10.1016/j.jcta.2013.04.005

M3 - Article

AN - SCOPUS:84876886213

VL - 120

SP - 1440

EP - 1449

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 7

ER -