On the covering of t-sets with (t+1)-sets: C(9,5,4) and C(10,6,5)

Authors:
D. de Caen;D. L. Kreher;S. P. Radziszowski;W. H. Mills
Affiliations:
-;-;-;-
Venue:
Discrete Mathematics
Year:
1991

Citing 0
Cited 3

The first classical Ramsey number for hypergraphs is computed

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The minimum likely column cover problem

Information Processing Letters
Optimal covering designs: complexity results and new bounds

Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)

Quantified Score

Hi-index	0.05

Visualization

Abstract