𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Doyen–Wilson theorem for bull designs

✍ Scribed by Fu, Chin-Mei; Lin, Yuan-Lung; Lo, Shu-Wen; Hsu, Yu-Fong; Huang, Wen-Chung

Book ID
122025876
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
252 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the doyen-wilson theorem for m-cycle
On the doyen-wilson theorem for m-cycle systems
✍ Darryn E. Bryant; C. A. Rodger 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 901 KB

## Abstract In this article we consider the embedding of __m__‐cycle systems of order __u__ in __m__‐cycle systems of order __v__ when __m__ is odd. When __u__ and __v__ are 1 or __m__ (mod 2__m__) we completely settle this problem, except possibly for the smallest such embedding in some cases when

The Doyen—Wilson theorem for minimum cov
The Doyen—Wilson theorem for minimum coverings with triples
✍ H. L. Fu; C. C. Lindner; C. A. Rodger 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

In this article necessary and sufficient conditions are found for a minimum covering of Km with triples to be embedded in a minimum covering of Kn with triples.

Doyen–Wilson theorem for nested Steiner
Doyen–Wilson theorem for nested Steiner triple systems
✍ Jinhua Wang; Hao Shen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract The obvious necessary conditions for the existence of a nested Steiner triple system of order __v__ containing a nested subsystem of order __w__ are __v__ ≥ 3__w__ + 4 and __v__ ≡ w ≡ 1 (mod 6). We show that these conditions are also sufficient. © 2004 Wiley Periodicals, Inc.

Two Doyen-Wilson theorems for maximum pa
Two Doyen-Wilson theorems for maximum packings with triples
✍ H.L. Fu; C.C. Lindner; C.A. Rodger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 424 KB

In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary and sufficient conditions for a maximum packing with triples of order m MPT(m) to be embedded in an MPT(n). We also characterize when it is possible to embed an MPT(m) with leave LI in an MPT(n) with le