Lower Bounds for Transversal Covers

Designs, Codes, and Cryptography

Volumn 15, Issue 3, 1998, Pages 279-299

  Stevens, Brett ^a   Moura, Lucia ^a   Mendelsohn, Eric ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Covering arrays; Qualitative independent partitions; Transversal covers; Transversal designs

Indexed keywords

EID: 0037681008     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008329410829     Document Type: Article

References (18)

1. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Software, Vol. 13, No. 5 (1996) pp. 83-88.
2. P. Erdös, C. Ko, and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford, Vol. 12 (1961) pp. 313-318.
3. Z. Füredi, Matchings and cover in hypergraphs, Graphs Combin., Vol. 4 (1988) pp. 115-206.
4. L. Gargano, J. Körner, and U. Vaccaro, Qualitative independence and Sperner problems for directed graphs, J. Combin. Theory. Ser. A, Vol. 61 (1992) pp. 173-192.
5. L. Gargano, J. Körner, and U. Vaccaro, Sperner capacities, Graphs Combin., Vol. 9 (1993) pp. 31-46.
6. L. Gargano, J. Körner, and U. Vaccaro, Capacities: From information theory to extremal set theory, J. Combin. Theory. Ser. A, Vol. 68 (1994) pp. 296-316.
7. F. Jaeger and C. Payan, Nombre maximal d'arêtes d'un hypergraphe critique de rang h, C. R. Acad. Sci. Paris, Vol. 273 (1971) pp. 221-223.
8. G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period. Math. Hungar., Vol. 3 (1973) pp. 19-26.
9. G. O. H. Katona, Solution of a problem of Ehrenfeucht and Mycielski, J. Combin. Theory. Ser. A, Vol. 17 (1974) pp. 265-266.
10. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discrete Math., Vol. 6 (1973) pp. 255-262.
11. J. Körner and M. Lucertini, Compressing inconsistent data, IEEE Trans. Inform. Theory, Vol. 40, No. 3 (1994) pp. 706-715.
12. B. Stevens, A. Ling and E. Mendelsohn, A direct construction of transversal covers using group divisible designs, in preparation.
13. S. Poljak and Z. Tuza, On the maximum number of qualitatively independent partitions, J. Combin. Theory. Ser. A, Vol. 51 (1989) pp. 111-116.
14. A. Rényi, Foundations of Probability, Wiley, New York (1971).
15. N. J. A. Sloane, Covering arrays and intersecting codes, J. Combin. Des., Vol. 1 (1993) pp. 51-63.
16. E. Sperner, Ein satz Über untermengen einer endlichen menge, Math Z., Vol. 27 (1928) pp. 544-548.
17. B. Stevens and E. Mendelsohn, New recursive methods for transversal covers, to appear in J. Combin. Des.
18. A. W. Williams and R. L. Probert, A practical strategy for testing pair-wise convergence of network interfaces, Proc. of the 7th International Symposium on Software Reliability Engineering, (1996) pp. 246-254.