Contents

-

Large Sets of λ-Fold P3-Factors in Kv,v

Guohui Hao1, Qingde Kang1
1Institute of Math., Hebei Normal University Shijiazhuang 050016, P.R. China

Abstract

Let G be a finite graph and H be a subgraph of G. If V(H)=V(G), then the subgraph H is called a spanningsubgraph of G. A spanning subgraph H of G is called an Ffactor if each component of H is isomorphic to F. Further, if there exists a subgraph of G whose vertex set is λV(G) and can be partitioned into F-factors, then it is called a λfoldFfactor of G, denoted by Sλ(1,F,G). A largeset of λ-fold F-factors in G is a partition {Bi}i of all subgraphs of G isomorphic to F, such that each (X,Bi) forms a λ-fold F-factor of G. In this paper, we investigate the large set of λ-fold P3-factors in Kv,v and obtain its existence spectrum.