2019/05/26 by Javadi, Ramin, Poorhadi, Ehsan, Fallah, Farshad
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1905.10807
For positive integers n≥ k≥ t, a collection B of k-subsets of an n-set X is called a t-packing if every t-subset of X appears in at most one set in B. In this paper, we give some upper and lower bounds for the maximum size of 3-packings when n is sufficiently larger than k. In one case, the upper and lower bounds are equal, in some cases, they differ by at most an additive constant depending only on k and in one case they differ by a linear bound in n .