设G是一个图,如果对于图G的每一条边,都有一个分数融因子覆盖它和另一个分数扛因子不包含它,则图G称为分数k一致图.得到了一个图是分数k一致图的若干结果.
A graph G is called a fractional k-uniform graph if for every edge of graph G, there is a fractional k-factor containing it and another fractional k-factor excluding it. Some sufficient conditions for a graph to be fractional k-uniform are given.