AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is v≡0(mod5). This condition is shown to be sufficient for v⩾215, with two known exceptions plus at most 17 possible exceptions below this value
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractLet v,k,λ and n be positive integers. (x1,x2,…,xk) is defined to be {(xi,xj):i≠j,i,j=1,2,…,k...
AbstractLet v, k and λ be positive integers. A perfect Mendelsohn design with parameters v, k and λ,...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractA necessary condition for the existence of an almost resolvable (v,5,1)-perfect Mendelsohn d...
AbstractLet v, k, and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) i...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractLet v, k and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractNecessary conditions for existence of a (v,k,λ) perfect Mendelsohn design (or PMD) are v ⩾ k...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
We complete the existence spectrum of perfect Mendelsohn designs PMD (v, 5 ) as v ≡ 0, 1 (mod 5), v...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractLet v,k,λ and n be positive integers. (x1,x2,…,xk) is defined to be {(xi,xj):i≠j,i,j=1,2,…,k...
AbstractLet v, k and λ be positive integers. A perfect Mendelsohn design with parameters v, k and λ,...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractA necessary condition for the existence of an almost resolvable (v,5,1)-perfect Mendelsohn d...
AbstractLet v, k, and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) i...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractLet v, k and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractNecessary conditions for existence of a (v,k,λ) perfect Mendelsohn design (or PMD) are v ⩾ k...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
We complete the existence spectrum of perfect Mendelsohn designs PMD (v, 5 ) as v ≡ 0, 1 (mod 5), v...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
AbstractLet v,k,λ and n be positive integers. (x1,x2,…,xk) is defined to be {(xi,xj):i≠j,i,j=1,2,…,k...
AbstractLet v, k and λ be positive integers. A perfect Mendelsohn design with parameters v, k and λ,...
DOI
Add to ORKG