论文信息 - On r-Cover-free Families - 字舞流文

On r-Cover-free Families

A very short proof is presented for the almost best upper bound for the size of anr-cover-free family overnelements.

Zoltán Füredi

[1] János Körner,et al. On the Extremal Combinatorics of the Hamming Space , 1994, J. Comb. Theory, Ser. A.

[2] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .

[3] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .

[4] Miklós Ruszinkó,et al. On the upper bound of the size of the r -cover-free families , 1994 .

[5] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.