AbstractLet v,k,λ and n be positive integers. (x1,x2,…,xk) is defined to be {(xi,xj):i≠j,i,j=1,2,…,k}, in which the ordered pair (xi,xj) is called (j−i)-apart for i<j and (k−j+i)-apart for i>j, and is called a cyclically ordered k-subset of {x1,x2,…,xk}. An incomplete perfect Mendelsohn design, denoted by (v,n,k,λ)-IPMD is a triple (X,Y,B), where X is a v-set (of points), Y is an n-subset of X, and B is a collection of cyclically ordered k-subsets of X (called blocks), such that every ordered pair (a,b)∈(X×X)⧹(Y×Y) appears t-apart in exactly λ blocks of B and no pair (a,b)∈Y×Y appears in any block of B for any t, where 1⩽t⩽k−1. In this article, we shall show that the necessary conditions v(v−1)−n(n−1)≡0(mod4),v⩾3n+1 for the existence of a (...
AbstractLet I(n, t) be the class of all t -intersecting families of subsets of [ n ] and set Ik(n, t...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
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 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 cyclic δ-support (n,k)μ difference family (briefly δ-supp (n,k)μ-CDF) is a family F of k-s...
AbstractLet v, k and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractLet qυ=υ(υ–1)(υ–2)/24 and let Iυ={0, 1, 2, …, qυ–14}∪{qυ–12, qυ–8, qυ}, for υ⩾8 Further, let...
AbstractIn 1994, van Trung (Discrete Math. 128 (1994) 337–348) [9] proved that if, for some positive...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
It is shown that a 4-(12,6,6) design, if it exists, must be rigid. The intimate relationship of such...
AbstractIt is proved that the obvious necessary conditions for the existence of a group divisible de...
AbstractLet B3(K)={v:∃S(3,K,v)}. For K={4} or {4,6}, B3(K) has been determined by Hanani. In this pa...
AbstractThe Ramsey number R(Cn, Km) is the smallest integer p such that any graph G on p vertices ei...
AbstractLet I(n, t) be the class of all t -intersecting families of subsets of [ n ] and set Ik(n, t...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...
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 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 cyclic δ-support (n,k)μ difference family (briefly δ-supp (n,k)μ-CDF) is a family F of k-s...
AbstractLet v, k and λ be positive integers. A (v, k, λ)-Mendelsohn design (briefly (v, k, λ)-MD) is...
AbstractLet qυ=υ(υ–1)(υ–2)/24 and let Iυ={0, 1, 2, …, qυ–14}∪{qυ–12, qυ–8, qυ}, for υ⩾8 Further, let...
AbstractIn 1994, van Trung (Discrete Math. 128 (1994) 337–348) [9] proved that if, for some positive...
AbstractA (v,k,λ)-perfect Mendelsohn packing (covering) design is a pair (X,A) where X is a v-set of...
It is shown that a 4-(12,6,6) design, if it exists, must be rigid. The intimate relationship of such...
AbstractIt is proved that the obvious necessary conditions for the existence of a group divisible de...
AbstractLet B3(K)={v:∃S(3,K,v)}. For K={4} or {4,6}, B3(K) has been determined by Hanani. In this pa...
AbstractThe Ramsey number R(Cn, Km) is the smallest integer p such that any graph G on p vertices ei...
AbstractLet I(n, t) be the class of all t -intersecting families of subsets of [ n ] and set Ik(n, t...
AbstractLet n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, C) w...
AbstractA necessary condition for the existence of a resolvable (v,5,1)-perfect Mendelsohn design is...