\((g,f)\)-factorizations orthogonal to a subgraph of a graph (Q1128115)

Let \(G=(V,E)\) be a graph and let \(f\) and \(g\) be two integer functions on \(V\) such that \(g(x)\leq f(x)\) for every \(x\in V\). Graph \(G\) is called a \((g,f)\)-graph if \(g(x)\leq d(x)\leq f(x)\) for every \(x\in G\). A \((g,f)\)-factorization of a graph is a partition of its edge set into spanning subgraphs each of which is a \((g,f)\)-graph. A factorization is said to be orthogonal to a subgraph \(H\) of a graph if every graph in the factorization has exactly one edge in common with \(H\). The paper provides a proof of the following result: If \(G\) is an \((mg+m-1, mf-m+1)\)-graph and \(H\) is a subgraph with \(m\) edges, then \(G\) has a \((g,f)\)-factorization orthogonal to \(H\).