Title of article :
Onr-Cover-free Families
Author/Authors :
Füredi، نويسنده , , Zoltلn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Pages :
2
From page :
172
To page :
173
Abstract :
A very short proof is presented for the almost best upper bound for the size of anr-cover-free family overnelements.
Journal title :
Journal of Combinatorial Theory Series A
Serial Year :
1996
Journal title :
Journal of Combinatorial Theory Series A
Record number :
1530070
Link To Document :
بازگشت