For every fixed graph H, we determine the H-covering number of K-n, for all n > n(0)(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists ii, = n,(H), such that for all n > n(0), [GRAPHICS] unless d is even, n = 1 mod d and n(n - 1)/d + 1 = 0 mod (2h/d), in which case [GRAPHICS] Our main tool in proving this result is the deep decomposition result of Gustavsson. (C) 1998 Academic Press. [References: 22]
展开▼
机译:对于每个固定图H,我们确定所有n> n(0)(h)的H覆盖k-n的数量。 我们证明,如果h是h的边缘的数量,并且gcd(h)= d是h的最大的常见除数,则存在II,= n,(h),使得所有n> n (0),[图形]除非D是偶数,否则n = 1 mod d和n(n - 1)/ d + 1 = 0 mod(2h / d),在这种情况下,[图形]我们在证明这一结果时的主要工具 是Gustavsson的深度分解结果。 (c)1998年学术出版社。 [参考:22]
展开▼