The Doyen Wilson Theorem for Minimum Coverings with Triples
نویسندگان
چکیده
In this article necessary and sufficient conditions are found for aminimum covering ofKm with triples to be embedded in a minimum covering ofKn with triples. c © 1997 JohnWiley & Sons, Inc. J Combin Designs 5: 341–352, 1997
منابع مشابه
Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of k-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. The application to the construction of short 2-radius sequences is given, along with some new 2-radius sequences found through a computer search.
متن کاملTwo Doyen-Wilson theorems for maximum packings with triples
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 leave L2 in such a way that L1 C L2.
متن کاملRevisiting the intersection problem for minimum coverings of complete graphs with triples
The intersection problem for minimum covers of Kn with triples has previously been settled in the case where the paddings are required to be equal. In this paper we extend this result by considering two generalizations: the paddings need not be equal, and the paddings are required to be simple.
متن کاملExistence of incomplete resolvable minimum coverings of pairs by triples
For given positive integers u and v with u ≡ v ≡ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u¿ 3v. c © 2003 Elsevier B.V. All rights reserved.
متن کاملA 2-COLORING OF [1, n] CAN HAVE n²/2a(a2+2a+3) + O(n) MONOCHROMATIC TRIPLES OF THE FORM . . .
We solve a problem posed by Ronald Graham about the minimum number, over all 2-colorings of [1, n], of monochromatic (x, y, x + ay) triples, a ≥ 2. We show that the minimum number of such triples is n 2 2a(a+2a+3) + O(n). We also find a new upper bound for the minimum number, over all r-colorings of [1, n], of monochromatic Schur triples, for r ≥ 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997