Maximum fractional factors in graphs

We prove that fractional kk-factors can be transformed among themselves by using a new adjusting operation repeatedly. We introduce, analogous to Berge’s augmenting path method in matching theory, the technique of increasing walk and derive a characterization of maximum fractional kk-factors in graphs. As applications of this characterization, several results about connected fractional 1-factors are obtained.