Upper Bounds for Turلn Numbers

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]