Long Lin

collaborators

2 papers

math.CO2026

On the product of cross-intersecting families with maximal covering number

Long Lin, Peter Frankl, Hehui Wu

For integers $k, ℓ \geq 2$ let $m (k, ℓ)$ denote the maximum of $∣ F ∣∣ G ∣$ where the maximum is taken over all pairs of cross-intersecting families, $\mathca…

math.CO2026

On the product of cross-intersecting families with small covering number

Peter Frankl, Long Lin, Hehui Wu

A central problem in extremal set theory is to determine or estimate $m (n, k, t), n > 2 k \geq 2 t$ , the maximum size of an intersecting $k$ -graph and covering number at least $t$ (see the…