✦ LIBER ✦

On the existence of blocking 3-sets in designs

✍ Scribed by Luigia Berardi; Fulvio Zuanni

Book ID: 108316355
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 94 KB
Volume: 208-209
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00062-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Blocking sets in 3-designs

✍ Mario Gionfriddo; Biagio Micale 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 471 KB

Note on the existence of large minimal b

Note on the existence of large minimal blocking sets in galois planes

✍ Tamás Szőnyi 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 488 KB

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi

On blocking sets in a design

✍ Luigia Berardi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 380 KB

In this paper we give a bound for the cardinality of an intersection set of a 2-(v,k,2) design D. We give a new proof of Drake's inequality for the cardinality of a blocking set of D. Our proof will enable us to characterize the case of equality. We investigate the existence of the blocking sets of

The existence of symmetric block designs

✍ H.J Ryser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Existence of large sets of coverings wit

Existence of large sets of coverings with block size 3

✍ L. Ji 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

## Abstract Two types of large sets of coverings were introduced by T. Etzion (J Combin Designs, 2(1994), 359–374). What is maximum number (denoted by λ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) coverings? What is the minimum number (denoted by µ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) co