Necessary and sufficient conditions are given for the existence of a maximum packing of K with triangles with all possible minimal leaves. This is of course equivalent to a maximum packing of a group divisible triple system with n groups of size m
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
A 6-cycle is said to be squashed if we identify a pair of opposite vertices and name one of them wit...
AbstractIt is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoi...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
. Frankl and Furedi established that the largest number of 3-subsets of an n-set for which no four ...
AbstractIn this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding nece...
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary an...
AbstractIt is well known that for n ≡ 1 or 3 (mod 6), n > 7, it is possible to partition all triples...
A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, ve...
AbstractThe graph consisting of the four 3-cycles (triples) (x1,x2,x8),(x2,x3,x4),(x4,x5,x6), and (x...
AbstractThe graph consisting of the three 3-cycles (a,b,c), (c,d,e), and (e,f,a), where a,b,c,d,e, a...
AbstractA pentagonal packing PP(n;t) is a family of t edge-disjoint pentagons in the complete graph ...
AbstractLet MPT (v, λ) denote a maximum packing of triples of order v and index λ. An MPT (v, λ) is ...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
A 6-cycle is said to be squashed if we identify a pair of opposite vertices and name one of them wit...
AbstractIt is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoi...
We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of ...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
. Frankl and Furedi established that the largest number of 3-subsets of an n-set for which no four ...
AbstractIn this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding nece...
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary an...
AbstractIt is well known that for n ≡ 1 or 3 (mod 6), n > 7, it is possible to partition all triples...
A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, ve...
AbstractThe graph consisting of the four 3-cycles (triples) (x1,x2,x8),(x2,x3,x4),(x4,x5,x6), and (x...
AbstractThe graph consisting of the three 3-cycles (a,b,c), (c,d,e), and (e,f,a), where a,b,c,d,e, a...
AbstractA pentagonal packing PP(n;t) is a family of t edge-disjoint pentagons in the complete graph ...
AbstractLet MPT (v, λ) denote a maximum packing of triples of order v and index λ. An MPT (v, λ) is ...
AbstractLet MPT(v,λ) denote a maximum packing of triples of order v with index λ and TS(u,λ) denote ...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
A 6-cycle is said to be squashed if we identify a pair of opposite vertices and name one of them wit...
AbstractIt is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoi...
DOI
Add to ORKG