图的分数f-因子的一类性质

A property of the fractional f-factors of graphs

给定图G的任一个子图H ,给出了图G有分数f -因子含有H的每条边 ,或不含H的任一条边的充要条件。利用这个条件 。

Let H be a subgraph of a graph G . Sufficient and necessary conditions are given for graph G to have a fractional f- factor that contains each edge of H or contains no any edge of H . And with the conditions, some sufficient conditions are given for graph G to have a fractional f -factor that contains H or contains no H .