𝔖 Bobbio Scriptorium
✦   LIBER   ✦

UPPER BOUNDS FOR LATINIZED DESIGNS

✍ Scribed by Williams, E.R. ;John, J.A.

Book ID
115210780
Publisher
Wiley (Blackwell Publishing)
Year
1993
Tongue
English
Weight
389 KB
Volume
35
Category
Article
ISSN
0004-9581

No coin nor oath required. For personal study only.

πŸ“œ 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

General Upper Bounds on the Minimum Size
General Upper Bounds on the Minimum Size of Covering Designs
✍ Iliya Bluskov; Katherine Heinrich πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 105 KB

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 nu

Lower bounds and upper bounds for chroma
Lower bounds and upper bounds for chromatic polynomials
✍ Klaus Dohmen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ Β© 1993 John Wiley & Sons, Inc.

Upper bounds for singular values
Upper bounds for singular values
✍ Jorma K. Merikoski; Ravinder Kumar πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 212 KB