We deal with simple graphs only. Let G be a graph，and g(x) and f (x) be integer-valued functions defined on V(G) such that g(x)≤f(x) for every x∈V(G)．Let H is a subgraph of G and F={F₁,F₂,…,F_t} is a (g,f) factorization of G. If |E(H)∩E(F_i)|=1, 1≤i≤t，then we say that F is orthogonal to H．In the paper［3］,Yan Guiying and Pan Jiaofeng gave the conjecture：Let G is an (mg+k,mf-k)-graph，1≤k