Randomly orthogonal factorizations of bipartite graphs (Q627394)

Let \(g\) and \(f\) be two nonnegative integer-valued functions defined on the vertex set \(V(G)\) of a graph \(G\) such that \(g(x)\leq f(x)\) for each \(x\in V(G)\). A \((g,f)\)-factor of \(G\) is a spanning subgraph \(F\) of \(G\) with \(g(x)\leq \deg_F(x)\leq f(x)\) for each \(x\in V(G)\). A \((g,f)\)-factorization of \(G\) is a partition of the edge set \(E(G)\) of \(G\) into edge-disjoint \((g,f)\)-factors of \(G\). Let \(H\) be an \(mr\)-edge subgraph of \(G\). A \((g,f)\)-factorization \(E(G)=\{F_1, F_2, \ldots,F_m\}\) of \(G\) is \(r\)-orthogonal if \(|E(H)\cap E(F_i)|=r\) for \(1\leq i\leq m\). If for any partition \(E(H)=\{A_1, A_2, \ldots, A_m\}\) with \(|A_i|=r\) there is a \((g,f)\)-factorization \(E(G)=\{F_1, F_2, \ldots,F_m\}\) of \(G\) such that \(A_i\subseteq E(F_i)\) for \(1\leq i\leq m\), then \(G\) has \((g,f)\)-factorizations randomly \(r\)-orthogonal to \(H\). The authors prove the following theorem: Let \(G\) be a bipartite \((0,mf-m+1)\)-graph, let \(f\) be an integer-valued function defined on \(V(G)\) such that \(f(x)\geq 3r-2\) for all \(x\in V(G)\), and let \(H\) be an \(mr\)-edge subgraph of \(G\). Then \(G\) has \((0,f)\)-factorizations randomly \(r\)-orthogonal to \(H\).