AbstractLet v, k and λ be positive integers. A perfect Mendelsohn design with parameters v, k and λ, denoted by (v, k, λ)-PMD, is a decomposition of the complete directed multigraph λkv* on v vertices into k-circuits such that for any r, 1 ⩽ r ⩽ k − 1, and for any two distinct vertices x and y there are exactly λ circuits along which the (directed) distance from x to y is r. It is known that a (6, 6, 1)-PMD does not exist. In this paper we show that a (v, 6, 1)-PMD exists for any v > 6, where v ≠ 0 or 1 (mod 6), with at most 150 possible exceptions of which 2604 is the largest
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block siz...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractNecessary conditions for existence of a (v,k,λ) perfect Mendelsohn design (or PMD) are v ⩾ k...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractLet v, k, and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) i...
We complete the existence spectrum of perfect Mendelsohn designs PMD (v, 5 ) as v ≡ 0, 1 (mod 5), v...
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 (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
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...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block siz...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractNecessary conditions for existence of a (v,k,λ) perfect Mendelsohn design (or PMD) are v ⩾ k...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) i...
AbstractLet v, k, and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) i...
We complete the existence spectrum of perfect Mendelsohn designs PMD (v, 5 ) as v ≡ 0, 1 (mod 5), v...
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 (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
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...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
AbstractLet v be a positive integer and let K be a set of positive integers. A (v,K,1)-Mendelsohn de...
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block siz...