Uniform cross-$t$-intersecting families: proving Hirschorn's conjecture up to polynomial factor

Abstract

We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity conjectured by Hirschorn in 2008. At the same time, we observe that it can be strictly bigger.

14 pages

References in corpus (1)

• Asymptotic upper bounds on the shades of t-intersecting families