In:
Combinatorics, Probability and Computing, Cambridge University Press (CUP), Vol. 8, No. 3 ( 1999-05), p. 265-268
Abstract:
A family of k sets is called a Δ- system if any two sets have the same intersection. Denote
by f ( r , k ) the least integer so that any r -uniform
family of f ( r , k ) sets contains a Δ-system
consisting of k sets. We prove that, for every fixed r , f ( r , k )
= k r + o ( k r ). Using a recent
result of Molloy and Reed [5] , a bound on the error term is
provided for sufficiently large k .
Type of Medium:
Online Resource
ISSN:
0963-5483
,
1469-2163
DOI:
10.1017/S0963548399003818
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
1999
detail.hit.zdb_id:
1481145-5
SSG:
17,1
Bookmarklink