摘要
Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued functions defined on V(G) such that 2k-1≤g(x) ≤ f(x) for all x ∈ V(G). Let H be a subgraph of G with mk edges . In this paper it is proved that every (mg + m - 1,mf- m + 1)-graph G has (g, f)-factorizations randomly κ-orthogonal to H and shown that the result is best possible.
Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued functions defined on V(G) such that 2k-1≤g(x) ≤ f(x) for all x ∈ V(G). Let H be a subgraph of G with mk edges . In this paper it is proved that every (mg + m - 1,mf- m + 1)-graph G has (g, f)-factorizations randomly κ-orthogonal to H and shown that the result is best possible.
基金
the National Natural Science Foundation of China (No.60172003,19831080) by NSF of Shandong Province.
