Title of article
Upper Bounds for Turلn Numbers
Author/Authors
Sidorenko، نويسنده , , Alexander، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
14
From page
134
To page
147
Abstract
A system ofr-element subsets (blocks) of ann-element setXnis called aTurلn(n, k, r)-systemif everyk-element subset ofXncontains at least one of the blocks. TheTurلn number T(n, k, r) is the minimum size of such a system. We prove upper estimates:[formula]
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series A
Record number
1530176
Link To Document