Fractional k-Factors of Graphs
Guizhen Liu · Gongcheng shuxue xuebao · 2005
Let G be a connected graph of order n and of Fan type. In this paper it is proved that if n ≥ 4 , then G has a fractional 1-factor, and if δ(G) ≥ k and n ≥ 8k2 + 12k + 6, then G has a fractional k-factor.