✦ LIBER ✦

Resolvable minimum coverings with quadruples

✍ Scribed by E. R. Lamken; W. H. Mills; R. S. Rees

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 460 KB
Volume: 6
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1998)6:6<431::aid-jcd5>3.0.co;2-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal resolvable packings and minimal

Maximal resolvable packings and minimal resolvable coverings of triples by quadruples

✍ Xiande Zhang; Gennian Ge 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order __v__ (MRPQS(__v__)) and minimal resolvabl

Resolvable candelabra quadruple systems

Resolvable candelabra quadruple systems with three groups

✍ Zhaoping Meng;; Beiliang Du 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

Candelabra quadruple systems play an important role in the construction of Steiner 3-designs. In this article, we consider resolvable candelabra quadruple systems with three groups and show that the necessary conditions on the existence of RCQS(g 3 : s) when g is even are also sufficient.

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.

Minimum coverings of Kυ with copies of K

Minimum coverings of Kυ with copies of K4 – e which contain no proper subsystems

✍ C. A. Rodger; Erin Spicer 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

proper subsystems exist if and only if v a Pf2Y 3Y 10g.

Covering the Edges of a Graph by a Presc

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over

Inside Cover: Host–Guest Geometry in Por

Inside Cover: Host–Guest Geometry in Pores of Zeolite ZSM-5 Spatially Resolved with Multiplex CARS Spectromicroscopy (Angew. Chem. Int. Ed. 6/2012)

✍ Dr. Katrin F. Domke; Dr. James P. R. Day; Gianluca Rago; T. Alexander Riemer; Dr 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB