论文信息 - Equitable resolvable coverings

Equitable resolvable coverings

In an earlier article, Willem H. Haemers has determined the minimum number of parallel classes in a resolvable 2-ðqk; k; 1Þ covering for all k 2 and q 1⁄4 2 or 3. Here, we complete the case q 1⁄4 4, by construction of the desired coverings using the method of simulated annealing. Secondly, we look at equitable resolvable 2-ðqk; k; 1Þ coverings. These are resolvable coverings which have the additional property that every pair of points is covered at most twice. We show that these coverings satisfy k q. # 2003 Wiley Periodicals, Inc. J Combin Designs 11: 113–123, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10024

[1] Albrecht Beutelspacher. On t-covers in finite projective spaces , 1979 .

[2] P. Östergård,et al. Upper Bounds for Covering Designs by Simulated Annealing , 1993 .

[3] J. Eisfeld. On smallest covers of finite projective spaces , 1997 .

[4] Willem H. Haemers,et al. Minimum resolvable coverings with small parallel classes , 1999, Discret. Math..

[5] W. H. Mills,et al. Resolvable minimum coverings with quadruples , 1998 .

[6] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .