Tight blocking sets in some maximum packings of lambdaKn
暂无分享,去创建一个
Let (X,B) be a (@lK"n,G)-packing with edge-leave L and a blocking set T. Let @C"1,@C"2,...,@C"s be all connected components of L with at least two vertices (note that s=0 if L=@A). The blocking set T is called tight if further V(@C"i)@?T @A and V(@C"i)@?(X@?T) @A for 1=
[1] Christopher A. Rodger,et al. 2-colouring K 4 -e designs. , 1991 .
[2] Kevin T. Phelps,et al. Blocking Sets in Designs with Block Size 4 , 1990, Eur. J. Comb..