AbstractIn 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 L1 in an MPT(n) with leave L2 in such a way that L1 ⊆ L2
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
We propose and study the following problem: given $X \subset Z_n$, construct a maximum packing of $d...
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary an...
AbstractNecessary and sufficient conditions are given to embed a maximum packing of Km with 4-cycles...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractLet MPT (v, λ) denote a maximum packing of triples of order v and index λ. An MPT (v, λ) is ...
Necessary and sufficient conditions are given for the existence of a maximum packing of K with trian...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractIt is well known that for n ≡ 1 or 3 (mod 6), n > 7, it is possible to partition all triples...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V i...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
AbstractThe graph consisting of the four 3-cycles (triples) (x1,x2,x8),(x2,x3,x4),(x4,x5,x6), and (x...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
We propose and study the following problem: given $X \subset Z_n$, construct a maximum packing of $d...
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary an...
AbstractNecessary and sufficient conditions are given to embed a maximum packing of Km with 4-cycles...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractLet MPT (v, λ) denote a maximum packing of triples of order v and index λ. An MPT (v, λ) is ...
Necessary and sufficient conditions are given for the existence of a maximum packing of K with trian...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractIt is well known that for n ≡ 1 or 3 (mod 6), n > 7, it is possible to partition all triples...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V i...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
AbstractThe graph consisting of the four 3-cycles (triples) (x1,x2,x8),(x2,x3,x4),(x4,x5,x6), and (x...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
We propose and study the following problem: given $X \subset Z_n$, construct a maximum packing of $d...
DOI
Add to ORKG