On the size of 33-uniform linear hypergraphs

This article provides bounds on the size of a 33-uniform linear hypergraph with restricted matching number and maximum degree. In particular, we show that if a 33-uniform, linear family FF has maximum matching size νν and maximum degree ΔΔ such that Δ≥236ν(1+1ν−1), then ∣F∣≤Δν∣F∣≤Δν.