Orthogonal factorizations of graphs (Q5906717)

A \((g,f)\)-factorization of a graph \(G\) is a partition of the edges of \(G\) into edge-disjoint spanning \((g,f)\)-factors. Given a factorization of \(G\) into \(m\) factors and a subgraph \(H\) of \(G\) with \(m\) edges, we say the factorization is orthogonal to \(H\) if each factor in the factorization has exactly one edge in common with \(H\). The authors prove that every \((mg+k, mf-k)\)-graph contains a subgraph \(R\) so that \(R\) has a \((g,f)\)-factorization orthogonal to a given subgraph with \(k\) edges (\(k < m\)).