设G是一个图,若对于图G的任一边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.文章证明了若k是整数且k≥2,t(G)≥k-1k,|V(G)|〉k+1,则G是分数k-消去图.并说明该结论在一定意义上是最好的.
A graph G is fractional k-deleted if there exists a fractional k-factor in G-e for any edge e of G.It is proved that G is fractional k-deleted if t(G)≥k-1k and |V(G)|k+1,where k≥2 is an integer.Moreover,This result is proved to be best possible in some sense.