✦ LIBER ✦

General Upper Bounds on the Minimum Size of Covering Designs

✍ Scribed by Iliya Bluskov; Katherine Heinrich

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 105 KB
Volume: 86
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2927

No coin nor oath required. For personal study only.

✦ Synopsis

Let D be a finite family of k-subsets (called blocks) of a v-set X(v). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering number. In this paper we find new upper bounds on the covering numbers for several families of parameters.

📜 SIMILAR VOLUMES

New upper bounds on the minimum size of

New upper bounds on the minimum size of covering designs

✍ Iliya Bluskov; Heikki Hämäläinen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size

Upper bounds on the general covering num

Upper bounds on the general covering number Cλ(v, k, t, m)

✍ Riccardo Bertolo; Iliya Bluskov; Heikki Hämäläinen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

## Abstract A collection $\cal C$ of __k__‐subsets (called __blocks__) of a __v__‐set __X__ (__v__) = {1, 2,…, __v__} (with elements called __points__) is called a __t__‐(__v__, __k__, __m__, λ) __covering__ if for every __m__‐subset M of __X__ (__v__) there is a subcollection $\cal K$ of $\cal C$

Upper Bounds on the Size of Obstructions

Upper Bounds on the Size of Obstructions and Intertwines

✍ Jens Lagergren 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun

Upper Bounds on the Covering Radius of a

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance

✍ S. Litsyn; A. Tietäväinen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .

An upper bound on the size of the larges

An upper bound on the size of the largest cliques in a graph

✍ Alain Billionnet 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB 👁 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An upper bound on the size of a largest

An upper bound on the size of a largest clique in a graph

✍ Dennis P. Geoffroy; David P. Sumner 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, ω(__G__), of a maximum clique in __G__ sat