Orthogonal factorizations in networks.

Let k1≥k2≥···≥km be positive integers. In this paper, we prove that every [0, k1+···+km-n+1]-graph G contains a subgraph R such that R has a [image omitted] -factorization orthogonal to any given subgraph H with n edges for every 1≤n≤m. [ABSTRACT FROM AUTHOR]